Pages that link to "Item:Q3147308"
From MaRDI portal
The following pages link to An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308):
Displayed 6 items.
- Max-min weight balanced connected partition (Q386475) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- An efficient algorithm to solve connectivity problem on trapezoid graphs (Q2454971) (← links)