The following pages link to Incremental modular decomposition (Q3823808):
Displaying 39 items.
- The homogeneous set sandwich problem (Q293307) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Peakless functions on graphs (Q678883) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Note on the homogeneous set sandwich problem (Q834997) (← links)
- On the closure of triangle-free graphs under substitution (Q915449) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
- A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
