English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Efficient Computation of implicit representations of sparse graphs

Arikati, S. R., Maheshwari, A., & Zaroliagis, C. (1997). Efficient Computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78(1-3), 1-16.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Arikati, Srinivasa Rao1, Author
Maheshwari, Anil2, Author           
Zaroliagis, Christos2, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517916
Other: Local-ID: C1256428004B93B8-B2263DD6EDF22FCBC12565D80038C7F5-ArikatiMaheshwariZaroliagis97
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Discrete Applied Mathematics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 78 (1-3) Sequence Number: - Start / End Page: 1 - 16 Identifier: -