Pages that link to "Item:Q5757900"

The following pages link to Linear-Time Algorithms for Tree Root Problems (Q5757900):

Displaying 19 items.

• Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
• The square of a block graph (Q965949) (← links)
• Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
• The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← 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)
• Linear-time algorithms for tree root problems (Q2346968) (← links)
• Complexity of finding graph roots with girth conditions (Q2428666) (← links)
• The tree inclusion problem (Q3189022) (← links)
• The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
• The 3-Steiner Root Problem (Q3508559) (← 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)
• Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
• Navigating Forest Straight-Line Programs in Constant Time (Q6485914) (← links)