Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 2119757

From MaRDI portal
Publication:4829032
Jump to:navigation, search

zbMath1058.94028MaRDI QIDQ4829032

Amos Korman, Michal Katz, Nir A. Katz, David Peleg

Publication date: 29 November 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of graph theory to circuits and networks (94C15)


Related Items (7)

Distributed verification of minimum spanning trees ⋮ Distance labeling scheme and split decomposition ⋮ Compact and localized distributed data structures ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Constructing labeling schemes through universal matrices ⋮ Informative labeling schemes for graphs




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4829032&oldid=19156480"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 03:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki