Pages that link to "Item:Q3964622"
From MaRDI portal
The following pages link to The Complexity of Coloring Circular Arcs and Chords (Q3964622):
Displaying 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- A note on optical routing on trees (Q287098) (← links)
- Embedding generalized Petersen graph in books (Q295940) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Exact and heuristic approaches to the airport stand allocation problem (Q319825) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- The \(k\)-track assignment problem (Q1319043) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Cyclic scheduling in a robotic production line (Q1347600) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396) (← links)