Edge ranking of graphs is hard
type: Item
instance of: scholarly article
title: Edge ranking of graphs is hard
zbMATH Open document ID: 0902.68088
DOI: 10.1016/S0166-218X(98)00029-8
author: Fung Ling Yue
author: Tak-Wah Lam
published in: Discrete Applied Mathematics
publication date: 1998-12-10T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1180318
zbMATH Keywords: graph labeling algorithms
zbMATH Keywords: edge ranking
MaRDI profile type: Publication
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Optimal edge ranking of trees in polynomial time
cites work: Q4942652
cites work: Q4198056
cites work: The NP-Completeness of Edge-Coloring
cites work: Optimal node ranking of trees
cites work: On an edge ranking problem of trees and graphs
cites work: Ordered colourings
cites work: Rankings of Directed Graphs
cites work: Local optimization on graphs
cites work: Q4142699
cites work: Optimal node ranking of tree in linear time
cites work: Q3326832
cites work: Algorithms for generalized vertex-rankings of partial k-trees
Recommended article: On an edge ranking problem of trees and graphs
Recommended article: Q3115250
Recommended article: Classes of graphs critical for the edge list-ranking problem
Recommended article: Rankings of Directed Graphs
Recommended article: Edge search in graphs and hypergraphs of bounded rank
Recommended article: Optimal edge ranking of complete bipartite graphs in polynomial time
Recommended article: Ranking by outdegree for directed graphs
Recommended article: Maximizing the number of edges in optimal \(k\)-rankings
Recommended article: On the rank of weighted graphs
Recommended article: Q4232782
description: scientific article; zbMATH DE number 1180318