Pages that link to "Item:Q294749"

The following pages link to Finding and counting small induced subgraphs efficiently (Q294749):

Displaying 13 items.

• Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
• Weighted well-covered claw-free graphs (Q482209) (← links)
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
• On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• Efficient algorithms for clique problems (Q976087) (← links)
• Equimatchable claw-free graphs (Q1660273) (← links)
• Are unique subgraphs not easier to find? (Q1707980) (← links)
• A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
• Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)