Edge ranking of graphs is hard (Q1392547): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q235652
Import recommendations run Q6767936
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Tak-Wah Lam / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimization on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized vertex-rankings of partial k-trees / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / Recommended article: On an edge ranking problem of trees and graphs / qualifier
 
Similarity Score: 0.9108647
Amount0.9108647
Unit1
Property / Recommended article: On an edge ranking problem of trees and graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3115250 / rank
 
Normal rank
Property / Recommended article: Q3115250 / qualifier
 
Similarity Score: 0.892587
Amount0.892587
Unit1
Property / Recommended article: Q3115250 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Classes of graphs critical for the edge list-ranking problem / rank
 
Normal rank
Property / Recommended article: Classes of graphs critical for the edge list-ranking problem / qualifier
 
Similarity Score: 0.8886707
Amount0.8886707
Unit1
Property / Recommended article: Classes of graphs critical for the edge list-ranking problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Rankings of Directed Graphs / rank
 
Normal rank
Property / Recommended article: Rankings of Directed Graphs / qualifier
 
Similarity Score: 0.8695703
Amount0.8695703
Unit1
Property / Recommended article: Rankings of Directed Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Edge search in graphs and hypergraphs of bounded rank / rank
 
Normal rank
Property / Recommended article: Edge search in graphs and hypergraphs of bounded rank / qualifier
 
Similarity Score: 0.86562157
Amount0.86562157
Unit1
Property / Recommended article: Edge search in graphs and hypergraphs of bounded rank / qualifier
 
Property / Recommended article
 
Property / Recommended article: Optimal edge ranking of complete bipartite graphs in polynomial time / rank
 
Normal rank
Property / Recommended article: Optimal edge ranking of complete bipartite graphs in polynomial time / qualifier
 
Similarity Score: 0.8650726
Amount0.8650726
Unit1
Property / Recommended article: Optimal edge ranking of complete bipartite graphs in polynomial time / qualifier
 
Property / Recommended article
 
Property / Recommended article: Ranking by outdegree for directed graphs / rank
 
Normal rank
Property / Recommended article: Ranking by outdegree for directed graphs / qualifier
 
Similarity Score: 0.86318684
Amount0.86318684
Unit1
Property / Recommended article: Ranking by outdegree for directed graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Maximizing the number of edges in optimal \(k\)-rankings / rank
 
Normal rank
Property / Recommended article: Maximizing the number of edges in optimal \(k\)-rankings / qualifier
 
Similarity Score: 0.8625339
Amount0.8625339
Unit1
Property / Recommended article: Maximizing the number of edges in optimal \(k\)-rankings / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the rank of weighted graphs / rank
 
Normal rank
Property / Recommended article: On the rank of weighted graphs / qualifier
 
Similarity Score: 0.86022496
Amount0.86022496
Unit1
Property / Recommended article: On the rank of weighted graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4232782 / rank
 
Normal rank
Property / Recommended article: Q4232782 / qualifier
 
Similarity Score: 0.86021125
Amount0.86021125
Unit1
Property / Recommended article: Q4232782 / qualifier
 

Latest revision as of 11:23, 4 April 2025

scientific article
Language Label Description Also known as
English
Edge ranking of graphs is hard
scientific article

    Statements

    Edge ranking of graphs is hard (English)
    0 references
    0 references
    0 references
    10 December 1998
    0 references
    graph labeling algorithms
    0 references
    edge ranking
    0 references

    Identifiers