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 (40)

On transitive orientations with restricted covering graphs
Decomposition of Directed Graphs
Nonpreemptive scheduling of independent tasks with prespecified processor allocations
Indecomposable graphs
Incremental construction of 2-structures
Dynamic labeled 2-structures
Polynomial-time recognition of clique-width \(\leq 3\) graphs
Irreducible pairings and indecomposable tournaments
Modular decomposition and transitive orientation
Title not available (Why is that?)
Critically indecomposable graphs
Optimal procedures for the discrete time/cost trade-off problem in project networks
Almost all comparability graphs are UPO
On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
Decomposition of infinite labeled 2-structures
A decomposition of distributive lattices
Applying modular decomposition to parameterized cluster editing problems
On the complexity of dynamic programming for sequencing problems with precedence constraints
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_4\)-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
Theory of 2-structures
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
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
Clique-perfectness and balancedness of some graph classes
On some complexity properties of N-free posets and posets with bounded decomposition diameter
Single machine scheduling with precedence constraints and positionally dependent processing times
Characterization and complexity of uniformly nonprimitive labeled 2-structures
ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P₄'S

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)