Pages that link to "Item:Q1961233"
From MaRDI portal
The following pages link to On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233):
Displaying 22 items.
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Rank numbers of grid graphs (Q712259) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- A lower bound for on-line ranking number of a path (Q878626) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- (Q6089678) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
