On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding minimum height elimination trees for interval graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / 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: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and generalizations, geometry and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Fill-in on Circle and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex ranking of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / 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: On a graph partition problem with application to VLSI layout / 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: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 12:09, 29 May 2024

scientific article
Language Label Description Also known as
English
On the vertex ranking problem for trapezoid, circular-arc and other graphs
scientific article

    Statements

    On the vertex ranking problem for trapezoid, circular-arc and other graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 2000
    0 references
    vertex ranking problem
    0 references
    graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers