scientific article; zbMATH DE number 3906240

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Decomposition methods (49M27)

Recommendations

scientific article; zbMATH DE number 3865355
scientific article; zbMATH DE number 3989366
Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes
On nonserial modification of a local algorithm for the decomposition of discrete optimization problems
Decomposition method of solving a class of combinatorial optimization problems

Cited in

(only showing first 100 items - show all)

Stability number of bull- and chair-free graphs revisited
Resolutions of probabilistic choice spaces
Miscellaneous digraph classes
PC trees and circular-ones arrangements.
Fully dynamic representations of interval graphs
Counting spanning trees using modular decomposition
On some complexity properties of N-free posets and posets with bounded decomposition diameter
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
scientific article; zbMATH DE number 3983218 (Why is no real title available?)
Modular decomposition of hypergraphs
Modular decomposition of graphs and the distance preserving property
Recognition of some perfectly orderable graph classes
Schedule-induced posets
Characterization and complexity of uniformly nonprimitive labeled 2-structures
Peakless functions on graphs
Bipartite bithreshold graphs
Single machine scheduling with precedence constraints and positionally dependent processing times
An algorithm computing combinatorial specifications of permutation classes
An \(O(n^2)\) time algorithm for the minimal permutation completion problem
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
Unavoidable induced subgraphs in large graphs with no homogeneous sets
Fully dynamic recognition algorithm and certificate for directed cographs
Maximum weight independent sets in hole- and co-chair-free graphs
On -sparse graphs and other families
The anti-join composition and polyhedra
Cluster editing: kernelization based on edge cuts
On independent vertex sets in subclasses of apple-free graphs
Simple permutations and algebraic generating functions
Tree-representation of set families and applications to combinatorial decompositions
The closure of monadic NP
Arc-disjoint paths in decomposable digraphs
\(O(m\log n)\) split decomposition of strongly-connected graphs
Graph decompositions definable in monadic second-order logic
Cograph editing: Merging modules is equivalent to editing P₄s
A Representation Theorem for Union-Difference Families and Application
Substitution and atomic extension on greedy posets
On probe permutation graphs
An efficient exact algorithm for triangle listing in large graphs
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Definable transductions and weighted logics for texts
On P₅-free locally split graphs
The bi-join decomposition
Recognition of prime graphs from a prime subgraph
(Nearly-)tight bounds on the contiguity and linearity of cographs
Reconstructing gene trees from Fitch's xenology relation
Monadic second-order definable text languages
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
O(m n) split decomposition of strongly connected graphs
Combining decomposition approaches for the maximum weight stable set problem
Structure and stability number of chair-, co-P- and gem-free graphs revisited
The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
A tight lower bound for primitivity in k-structures
Critically indecomposable graphs
scientific article; zbMATH DE number 2230220 (Why is no real title available?)
The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
Interval decomposition lattices are balanced
Probe Ptolemaic Graphs
Almost all comparability graphs are UPO
Symmetric maximal Condorcet domains
scientific article; zbMATH DE number 3865355 (Why is no real title available?)
The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Linear-time modular decomposition of directed graphs
On algorithms for (P₅, gem)-free graphs
Resolutions of convex geometries
New applications of clique separator decomposition for the maximum weight stable set problem
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
A decomposition of distributive lattices
Solving some NP-complete problems using split decomposition
On the complexity of dynamic programming for sequencing problems with precedence constraints
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
The stable set polytope for some extensions of \(P_4\)-free graphs
Applying modular decomposition to parameterized cluster editing problems
Practical and efficient split decomposition via graph-labelled trees
Asymptotic enumeration of two-dimensional posets
Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
A supernodal formulation of vertex colouring with applications in course timetabling
Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
\(P_ 4\)-trees and substitution decomposition
Resource-constrained project scheduling: Notation, classification, models, and methods
A survey of the algorithmic aspects of modular decomposition
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
Decomposition of k-ary relations
On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
On minimal prime extensions of a four-vertex graph in a prime graph
A canonical tree decomposition for order types, and some applications
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
Algorithmic aspects of a general modular decomposition theory
Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
On distance-3 matchings and induced matchings
Network decomposition for the optimization of connection structures
The recognizability of sets of graphs is a robust property
Circle graphs and monadic second-order logic
A k-structure generalization of the theory of 2-structures
Existential MSO over two successors is strictly weaker than over linear orders
Unifying the representation of symmetric crossing families and weakly partitive families
From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats

This page was built for publication:

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