scientific article; zbMATH DE number 2119757

From MaRDI portal

Revision as of 02:11, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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"