A Fast Algorithm for the Decomposition of Graphs and Posets

Numerical mathematical programming methods (65K05) Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Graph theory (05C99)

Cited in

(41)

On transitive orientations with restricted covering graphs
Indecomposable graphs
Decomposition of Directed Graphs
Nonpreemptive scheduling of independent tasks with prespecified processor allocations
Incremental construction of 2-structures
Dynamic labeled 2-structures
Polynomial-time recognition of clique-width 3 graphs
Irreducible pairings and indecomposable tournaments
Modular decomposition and transitive orientation
Critically indecomposable graphs
On the clique-width of graph with few \(P_{4}\)'s
scientific article; zbMATH DE number 2230220 (Why is no real title available?)
Optimal procedures for the discrete time/cost trade-off problem in project networks
Almost all comparability graphs are UPO
On extended P₄-reducible and extended P₄-sparse graphs
A decomposition of distributive lattices
On the complexity of dynamic programming for sequencing problems with precedence constraints
Applying modular decomposition to parameterized cluster editing problems
Decomposition of infinite labeled 2-structures
Indecomposable tournaments with minimum Slater index
Group based graph transformations and hierarchical representations of graphs
\(P_ 4\)-trees and substitution decomposition
On finding the jump number of a partial order by substitution decomposition
A continuous rating method for preferential voting: the complete case
The discrete time-cost tradeoff problem revisited
Complexity of list coloring problems with a fixed total number of colors
Minimizing bumps in ordered sets by substitution decomposition
Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
The dimension of graphs with respect to the direct powers of a two-element graph
On semi-\(P_ 4\)-sparse graphs
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Theory of 2-structures
Scattering number and modular decomposition
An algorithm for minimizing setups in precedence constrained scheduling
Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
A combinatorial bijection between linear extensions of equivalent orders
On some complexity properties of N-free posets and posets with bounded decomposition diameter
Clique-perfectness and balancedness of some graph classes
Characterization and complexity of uniformly nonprimitive labeled 2-structures
Single machine scheduling with precedence constraints and positionally dependent processing times

This page was built for publication: A Fast Algorithm for the Decomposition of Graphs and Posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665151)