On the vertex ranking problem for trapezoid, circular-arc and other graphs
From MaRDI portal
Recommendations
Cites work
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Asteroidal Triple-Free Graphs
- Complement reducible graphs
- Edge ranking of graphs is hard
- Finding minimum height elimination trees for interval graphs in polynomial time
- scientific article; zbMATH DE number 437537 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1303585 (Why is no real title available?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- Minimum Fill-in on Circle and Circular-Arc Graphs
- On a graph partition problem with application to VLSI layout
- On an edge ranking problem of trees and graphs
- On the 2-Chain Subgraph Cover and Related Problems
- Optimal edge ranking of trees in polynomial time
- Optimal node ranking of tree in linear time
- Optimal node ranking of trees
- Ordered colourings
- Rankings of Graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Complexity of the Partial Order Dimension Problem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
- Trapezoid graphs and generalizations, geometry and algorithms
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Treewidth and Pathwidth of Permutation Graphs
- Treewidth. Computations and approximations
- Vertex ranking of asteroidal triple-free graphs
Cited in
(26)- Finding the edge ranking number through vertex partitions
- On the diameter of tree associahedra
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
- Easy and hard instances of arc ranking in directed graphs
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Ordered coloring grids and related graphs
- Computing tree-depth faster than \(2^n\)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- Disconnected matchings
- Disconnected matchings
- Competitive Online Search Trees on Trees
- scientific article; zbMATH DE number 7764121 (Why is no real title available?)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- On the hardness of inclusion-wise minimal separators enumeration
- On the size of minimal separators for treedepth decomposition
- Combinatorial generation via permutation languages. IV: Elimination trees
- Rank numbers of grid graphs
- Linear versus centred colouring via pseudogrids
- Ranking numbers of graphs
- An optimal parallel algorithm forc-vertex-ranking of trees
- Vertex rankings of chordal graphs and weighted trees
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
- A lower bound for on-line ranking number of a path
- Constructing a minimum height elimination tree of a tree in linear time
- Optimal vertex ranking of block graphs
This page was built for publication: On the vertex ranking problem for trapezoid, circular-arc and other graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961233)
