Modular decomposition and transitive orientation
From MaRDI portal
(Redirected from Publication:1301738)
Recommendations
- The orientation of modules based on graph decomposition
- A characterization of modularity and orthomodularity
- Decomposition of modules
- Modular decomposition of the Orlik-Terao algebra
- scientific article; zbMATH DE number 1538997
- Modular decomposition and the reconstruction conjecture
- Decomposing torsion modules
- Direct decompositions of orthomodular lattices
- Lattice decomposition of modules
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3825206 (Why is no real title available?)
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 512932 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A Fast Algorithm for the Decomposition of Graphs and Posets
- A Linear Recognition Algorithm for Cographs
- A linear time algorithm to recognize circular permutation graphs
- A linear-time algorithm for a special case of disjoint set union
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Circular permutation graphs
- Complement reducible graphs
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Incremental modular decomposition
- On Comparability and Permutation Graphs
- On testing isomorphism of permutation graphs
- On the X-join decomposition for undirected graphs
- Partially Ordered Sets
- Partitive hypergraphs
- Primitivity is hereditary for 2-structures
- Single Machine Scheduling with Series-Parallel Precedence Constraints
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Recognition of Series Parallel Digraphs
- The complexity of comparability graph recognition and coloring
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- \(P_ 4\)-trees and substitution decomposition
Cited in
(only showing first 100 items - show all)- Bisplit graphs
- scientific article; zbMATH DE number 1508917 (Why is no real title available?)
- Algorithms for the rainbow vertex coloring problem on graph classes
- New applications of clique separator decomposition for the maximum weight stable set problem
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Rigidity of graph products of groups.
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Subgraph isomorphism on graph classes that exclude a substructure
- Minimal triangulations of graphs: a survey
- A new LBFS-based algorithm for cocomparability graph recognition
- Vertex splitting and the recognition of trapezoid graphs
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- Graphs of linear clique-width at most 3
- A simpler linear-time recognition of circular-arc graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Linear-time modular decomposition of directed graphs
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Phylogenetic graph models beyond trees
- An efficient algorithm for solving the homogeneous set sandwich problem
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Weighted maximum-clique transversal sets of graphs
- On the power of graph searching for cocomparability graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs
- The recognition of triangle graphs
- scientific article; zbMATH DE number 1753166 (Why is no real title available?)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On variations of \(P_{4}\)-sparse graphs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- On uniqueness of a general factorization of graph properties
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Recognizing \(k\)-equistable graphs in FPT time
- Solving some NP-complete problems using split decomposition
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs
- Permutation bigraphs and interval containments
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- On algorithms for (\(P_5\), gem)-free graphs
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Two forbidden induced subgraphs and well-quasi-ordering
- Interval decomposition lattices are balanced
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- The clique operator on cographs and serial graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- The bi-join decomposition
- Independent domination in finitely defined classes of graphs
- Note on the homogeneous set sandwich problem
- Algorithm Theory - SWAT 2004
- Simple DFS on the complement of a graph and on partially complemented digraphs
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- On distance-3 matchings and induced matchings
- Tent and a subclass of \(P_{5}\)-free graphs
- On independent vertex sets in subclasses of apple-free graphs
- Algorithmic aspects of a general modular decomposition theory
- A survey of the algorithmic aspects of modular decomposition
- Weak order polytopes.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- Efficient and practical algorithms for sequential modular decomposition
- Recognition of some perfectly orderable graph classes
- On the hull number of some graph classes
- Weighted independent sets in classes of \(P_6\)-free graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- The possible cardinalities of global secure sets in cographs
- The stable set polytope for some extensions of \(P_4\)-free graphs
- Witness (Delaunay) graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Independent sets in asteroidal triple-free graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- The orientation of modules based on graph decomposition
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Graph isomorphism restricted by lists
- Parallel comparability graph recognition and modular decomposition
- Maximum induced matching algorithms via vertex ordering characterizations
- Coloring mixed and directional interval graphs
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Graph classes and forbidden patterns on three vertices
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Computing and listing avoidable vertices and paths
- A polynomial kernel for bipartite permutation vertex deletion
- Finding connected secluded subgraphs
- scientific article; zbMATH DE number 1554932 (Why is no real title available?)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
- Complexity and parameterized algorithms for cograph editing
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- The graph sandwich problem for \(P_4\)-sparse graphs
This page was built for publication: Modular decomposition and transitive orientation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301738)
