Pages that link to "Item:Q2346968"
From MaRDI portal
The following pages link to Linear-time algorithms for tree root problems (Q2346968):
Displaying 12 items.
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Linear-time construction of treaps and Cartesian trees (Q1339378) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- The tree inclusion problem (Q3189022) (← links)
- Minimax Trees in Linear Time with Applications (Q3651553) (← links)
- A Linear Time Algorithm for Finding ak-Tree Core (Q4339005) (← links)
- (Q4472520) (← links)
- (Q4500845) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Navigating Forest Straight-Line Programs in Constant Time (Q6485914) (← links)