Pages that link to "Item:Q729821"

The following pages link to Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821):

Displaying 14 items.

• Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
• An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
• Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
• Complexity of independency and cliquy trees (Q2283099) (← links)
• Dealing with several parameterized problems by random methods (Q2636503) (← links)
• Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
• A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
• (Q5075762) (← links)
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)