scientific article; zbMATH DE number 3906240

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

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)

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

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)