A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
DOI10.1016/J.IPL.2007.03.014zbMATH Open1185.05122OpenAlexW1997290361MaRDI QIDQ2379975FDOQ2379975
Authors: Shin-Ichi Nakayama, Shigeru Masuyama 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.014
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Optimal node ranking of trees
- Rankings of Graphs
- Title not available (Why is that?)
- On an edge ranking problem of trees and graphs
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
- Finding minimum height elimination trees for interval graphs in polynomial time
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Title not available (Why is that?)
- Edge ranking of graphs is hard
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
Cited In (3)
This page was built for publication: A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379975)
