Pages that link to "Item:Q990956"

The following pages link to Counting the number of vertex covers in a trapezoid graph (Q990956):

Displaying 9 items.

• Closest pair and the post office problem for stochastic points (Q390124) (← links)
• Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
• Counting independent sets in a tolerance graph (Q479039) (← links)
• Fast and simple algorithms to count the number of vertex covers in an interval graph (Q845989) (← links)
• Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (Q963461) (← links)
• Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
• Counting maximal independent sets in directed path graphs (Q2015155) (← links)
• The hub number of co-comparability graphs (Q2514123) (← links)
• Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)