Pages that link to "Item:Q3683548"
From MaRDI portal
The following pages link to Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs (Q3683548):
Displaying 29 items.
- Two remarks on circular arc graphs (Q675889) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- The maximum clique problem (Q1318271) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
