The following pages link to (Q3328583):
Displayed 50 items.
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- An evolution of interval graphs (Q912869) (← links)
- On the closure of triangle-free graphs under substitution (Q915449) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- A note on first-fit coloring of interval graphs (Q925259) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Two methods for the generation of chordal graphs (Q940844) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- The positive definite completion problem revisited (Q947605) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium (Q961360) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- The square of a block graph (Q965949) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- On probe permutation graphs (Q967305) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- A new characterization of matrices with the consecutive ones property (Q967442) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- Approximating the Minimum Chain Completion problem (Q989547) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)