Pages that link to "Item:Q3790662"
From MaRDI portal
The following pages link to An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662):
Displayed 25 items.
- Polygon guarding with orientation (Q340539) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Linear time algorithms on circular-arc graphs (Q1183454) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- The maximum clique problem (Q1318271) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- Parallel algorithms on circular-arc graphs (Q5917729) (← links)