Pages that link to "Item:Q1825031"
From MaRDI portal
The following pages link to Optimal node ranking of tree in linear time (Q1825031):
Displaying 49 items.
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Search-space size in contraction hierarchies (Q306264) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Rank numbers of grid graphs (Q712259) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- Maximum matchings of a digraph based on the largest geometric multiplicity (Q1793197) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- (Q4625695) (← links)
- Improved Bounds for the Excluded-Minor Approximation of Treedepth (Q4990393) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- (Q5874487) (← links)
- On low rank-width colorings (Q5918207) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- (Q6089678) (← links)
- PACE Solver Description: Tree Depth with FlowCutter (Q6089681) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
