Pages that link to "Item:Q396607"
From MaRDI portal
The following pages link to Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607):
Displaying 6 items.
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q2342672) (← links)
- An efficient algorithm to solve connectivity problem on trapezoid graphs (Q2454971) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)