Pages that link to "Item:Q2480902"

The following pages link to Linear time algorithms for generalized edge dominating set problems (Q2480902):

Displaying 10 items.

• On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
• Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
• Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
• Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
• On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
• Erratum to: ``Linear time algorithms for generalized edge dominating set problems'' (Q2428651) (← links)
• On well-edge-dominated graphs (Q2673496) (← links)
• Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
• Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
• Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)