scientific article; zbMATH DE number 2119757

zbMATH Open1058.94028MaRDI QIDQ4829032FDOQ4829032

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

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

Recommendations

• Labeling Schemes for Flow and Connectivity
• Labeling Schemes for Vertex Connectivity
• Labeling schemes for vertex connectivity
• A note on labeling schemes for graph connectivity
• An optimal labeling for node connectivity

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)

Cited In (12)

• Labeling schemes for vertex connectivity
• Constructing labeling schemes through universal matrices
• Trade-offs between the size of advice and broadcasting time in trees
• Distributed verification of minimum spanning trees
• Informative labeling schemes for graphs
• Compact and localized distributed data structures
• Communication algorithms with advice
• An optimal labeling for node connectivity
• Distance labeling scheme and split decomposition
• A note on labeling schemes for graph connectivity
• Labeling Schemes for Vertex Connectivity
• Labeling Schemes for Flow and Connectivity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829032)