Incremental modular decomposition
From MaRDI portal
Recommendations
- Efficient and practical algorithms for sequential modular decomposition
- Block decomposition for modules
- Modular instantiation schemes
- Decomposition of modules
- Incremental and modular context-sensitive analysis
- scientific article; zbMATH DE number 1456953
- Incremental determinization
- scientific article; zbMATH DE number 3874627
- Modularity
Cited in
(63)- An efficient algorithm to find next-to-shortest path on permutation graphs
- The discrete time-cost tradeoff problem revisited
- Transitive closure for restricted classes of partial orders
- Connected domination and Steiner set on weighted permutation graphs
- \(P_ 4\)-trees and substitution decomposition
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Modular decomposition and transitive orientation
- Primitive 2-structures with the (n-2)-property
- A k-structure generalization of the theory of 2-structures
- On semi-\(P_ 4\)-sparse graphs
- The facets of the polytope of modules of a graph.
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- An efficient algorithm for solving the homogeneous set sandwich problem
- The graph sandwich problem for 1-join composition is NP-complete
- Fully dynamic representations of interval graphs
- Single machine scheduling with precedence constraints and positionally dependent processing times
- A linear algorithm to decompose inheritance graphs into modules
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Upper bounds to the clique width of graphs
- Letter graphs and modular decomposition
- From modular decomposition trees to rooted median graphs
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Scheduling with due date assignment under special conditions on job processing
- Fully dynamic recognition algorithm and certificate for directed cographs
- Minimum 2-tuple dominating set of permutation graphs
- Efficient and practical algorithms for sequential modular decomposition
- The homogeneous set sandwich problem
- Capturing polynomial time using modular decomposition
- On Indecomposability Preserving Elimination Sequences
- Equistable graphs
- scientific article; zbMATH DE number 1741000 (Why is no real title available?)
- scientific article; zbMATH DE number 1107727 (Why is no real title available?)
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- scientific article; zbMATH DE number 1508917 (Why is no real title available?)
- A survey of the algorithmic aspects of modular decomposition
- Theory of 2-structures
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Minimum r-neighborhood covering set of permutation graphs
- Cograph editing: Merging modules is equivalent to editing P₄s
- A distance measure for large graphs based on prime graphs
- Unifying Two Graph Decompositions with Modular Decomposition
- scientific article; zbMATH DE number 966717 (Why is no real title available?)
- A review of the contribution of operational research to project management
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- Computation of diameter, radius and center of permutation graphs
- Efficient parallel modular decomposition (extended abstract)
- Result invalidation for incremental modular analyses
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- An algorithm for finding homogeneous pairs
- Peakless functions on graphs
- More on discrete convexity
- On the calculation of transitive reduction-closure of orders
- Bipartite bithreshold graphs
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Approximating modular decomposition is hard
- Note on the homogeneous set sandwich problem
- On the closure of triangle-free graphs under substitution
- Not complementary connected and not CIS d-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
This page was built for publication: Incremental modular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823808)
