Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three

DOI10.1007/978-3-030-00256-5_30MaRDI QIDQ1627193zbMATH OpenOpenAlexFDO

Authors B. S. Panda, Anita Das

Publication date 22 November 2018

Full work available at URL https://doi.org/10.1007/978-3-030-00256-5_30

zbMATH Keywords

NP-completenessdirected path graphstree spanners

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
• Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
• Optimal tree 3-spanners in directed path graphs
• Tree spanners of bounded degree graphs
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms

Cited in

(8)

• Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
• Hardness and efficiency on \(t\)-admissibility for graph operations
• On tree-\(t\)-spanners in graphs
• On tree 3‐spanners in directed path graphs
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
• Tree spanners of bounded degree graphs
• Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
• Hardness and efficiency on minimizing maximum distances in spanning trees

This page was built for publication: Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three

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