Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs

DOI10.1007/978-3-642-02017-9_19MaRDI QIDQ3630201zbMATH OpenOpenAlexFDO

Authors Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_19

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On vertex ranking for permutation and other graphs
• Some Efficient Algorithms for Permutation Graphs
• Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
• Minimum edge ranking spanning trees of split graphs
• Minimum edge ranking spanning trees of threshold graphs

Cited in

(5)

• Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
• Minimum edge ranking spanning trees of threshold graphs
• On vertex ranking for permutation and other graphs
• Minimum edge ranking spanning trees of split graphs
• NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem

This page was built for publication: Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs

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