scientific article; zbMATH DE number 2119757

MaRDI QIDQ4829032zbMATH OpenFDO

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

Publication date 29 November 2004

Mathematics Subject Classification ID

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

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

Cited in

(12)

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

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)