Pages that link to "Item:Q1886097"
From MaRDI portal
The following pages link to Algorithmic graph theory and perfect graphs (Q1886097):
Displayed 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Clique-width of path powers (Q266933) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- An approximate algorithm for the chromatic number of graphs (Q283679) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Context-specific independence in graphical log-linear models (Q333386) (← links)
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Local properties of simplicial complexes (Q367421) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Matrices attaining the minimum semidefinite rank of a chordal graph (Q389640) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Retaining positive definiteness in thresholded matrices (Q414695) (← links)
- A characterization of graphs with rank 5 (Q414705) (← links)
- Edge search number of cographs (Q415273) (← links)
- A note on chromatic properties of threshold graphs (Q418900) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- On the online track assignment problem (Q423916) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Ordered coloring of grids and related graphs (Q442258) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)