Pages that link to "Item:Q963461"
From MaRDI portal
The following pages link to Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (Q963461):
Displaying 4 items.
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Fast and simple algorithms to count the number of vertex covers in an interval graph (Q845989) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)