Pages that link to "Item:Q972342"
From MaRDI portal
The following pages link to On the complexity of computing treelength (Q972342):
Displaying 18 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Burning Two Worlds (Q3297761) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- (Q6089669) (← links)
