Pages that link to "Item:Q3956413"
From MaRDI portal
The following pages link to Efficient algorithms for interval graphs and circular-arc graphs (Q3956413):
Displaying 50 items.
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- On a circle-cover minimization problem (Q790622) (← 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)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Optimal algorithm for a special point-labeling problem (Q1029054) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- On the domatic number of interval graphs (Q1111388) (← 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)
- Linear time algorithms on circular-arc graphs (Q1183454) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Processor optimization for flow graphs (Q1200808) (← links)
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
- Packing chained items in aligned bins with applications to container transshipment and project scheduling (Q1935930) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- New results on induced matchings (Q1975379) (← links)
- Air traffic flow management with layered workload constraints (Q2027028) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
