Pages that link to "Item:Q916397"
From MaRDI portal
The following pages link to Finding a maximum independent set in a permutation graph (Q916397):
Displaying 10 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
- Bounds on 2-point set domination number of a graph (Q4603879) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
