Pages that link to "Item:Q1301738"
From MaRDI portal
The following pages link to Modular decomposition and transitive orientation (Q1301738):
Displaying 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Interval decomposition lattices are balanced (Q305165) (← links)
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- Note on the homogeneous set sandwich problem (Q834997) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- Polar graphs and maximal independent sets (Q860455) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- On probe permutation graphs (Q967305) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
