Pages that link to "Item:Q1336626"

The following pages link to Combinatorial algorithms on a class of graphs (Q1336626):

Displaying 17 items.

• An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
• Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
• Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
• Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
• Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
• Integer programming approach to static monopolies in graphs (Q1752610) (← links)
• Recognition of directed acyclic graphs by spanning tree automata (Q1959657) (← links)
• Cross-series-parallel digraphs (Q1983112) (← links)
• Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
• A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
• Combinatorial Scoring of Phylogenetic Networks (Q2817897) (← links)
• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
• On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
• A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
• Maximum cycle packing using SPR-trees (Q5009941) (← links)
• Counting dominating sets in generalized series-parallel graphs (Q5207508) (← links)
• Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)