Edge tree spanners

DOI10.1007/978-3-030-63072-0_16zbMATH Open1479.05052OpenAlexW3135634383MaRDI QIDQ2056906FDOQ2056906

Authors: F. Couto, Luís Felipe Ignácio Cunha, Daniel F. D. Posner 

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_16

Recommendations

• Tree Spanners
• scientific article; zbMATH DE number 434687
• Edge-magic trees
• Spanning trees whose stems are spiders
• scientific article; zbMATH DE number 1933253
• scientific article; zbMATH DE number 431364
• scientific article; zbMATH DE number 3906515
• Spanning trees in a cactus
• Spanning Trees with Many Leaves
• Spanning trees with many leaves

zbMATH Keywords

NP-completenessgraph classesline graphspolynomial time algorithmstree \(t\)-spanneredge tree \(t\)-spanner

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Optimal Synchronizer for the Hypercube
• Tree Spanners
• Title not available (Why is that?)
• P-Components and the Homogeneous Decomposition of Graphs
• Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs
• Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently

Cited In (5)

• Tree 3-spanners on generalized prisms of graphs
• Hardness and efficiency on \(t\)-admissibility for graph operations
• Minimum \(t\)-spanners on subcubic graphs
• Polynomial algorithms for sparse spanners on subcubic graphs
• Title not available (Why is that?)

This page was built for publication: Edge tree spanners

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