Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs

DOI10.1007/978-3-642-02017-9_19zbMATH Open1241.05017OpenAlexW1508100353MaRDI QIDQ3630201FDOQ3630201

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

Recommendations

• Publication:4942652
• 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
• scientific article; zbMATH DE number 1979519

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Minimum edge ranking spanning trees of split graphs
• NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
• Title not available (Why is that?)
• Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

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)