Easy and hard instances of arc ranking in directed graphs

DOI10.1016/j.dam.2007.07.013zbMath1127.05035OpenAlexW2006231483MaRDI QIDQ2462400

Dariusz Dereniowski

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.013

zbMATH Keywords

computational complexitydigraphcaterpillargraph ranking

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• On an edge ranking problem of trees and graphs
• Optimal node ranking of trees
• Edge ranking of graphs is hard
• Ordered colourings
• Edge ranking of weighted trees
• Rankings of Graphs
• Rankings of Directed Graphs

This page was built for publication: Easy and hard instances of arc ranking in directed graphs