Modular decomposition and transitive orientation
From MaRDI portal
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)- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Approximation of knapsack problems with conflict and forcing graphs
- Partial and simultaneous transitive orientations via modular decompositions
- Maximum weight independent sets in hole- and co-chair-free graphs
- Parameterized algorithms for the happy set problem
- The P4-sparse Graph Sandwich Problem
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- Transitive orientations in bull-reducible Berge graphs
- On independent vertex sets in subclasses of apple-free graphs
- The clique operator on graphs with few \(P_{4}\)'s
- scientific article; zbMATH DE number 1753166 (Why is no real title available?)
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On transitive orientations with restricted covering graphs
- The orientation of modules based on graph decomposition
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Two forbidden induced subgraphs and well-quasi-ordering
- Weighted maximum-clique transversal sets of graphs
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- An implicit representation of chordal comparability graphs in linear time
- Lexicographic orientation algorithms
- Computing densest \(k\)-subgraph with structural parameters
- Cograph editing: Merging modules is equivalent to editing P_4s
- Linear-time algorithms for maximum sets of sources and sinks
- Partitioned probe comparability graphs
- How Bad is the Freedom to Flood-It?
- A note on transitive orientations with maximum sets of sources and sinks
- A combinatorial study of partial order polytopes
- On probe permutation graphs
- List matrix partitions of graphs representing geometric configurations
- The graph sandwich problem for P₄-sparse graphs
- Polynomial-time recognition of clique-width 3 graphs
- Graphs of linear clique-width at most 3
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Bisplit graphs
- Structural parameterizations of vertex integrity (best paper)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
- On variations of \(P_{4}\)-sparse graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- A recognition algorithm for simple-triangle graphs
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- The bi-join decomposition
- The facets of the polytope of modules of a graph.
- On the power of graph searching for cocomparability graphs
- Exact leaf powers
- \(st\)-orientations with few transitive edges
- Algorithm Theory - SWAT 2004
- $st$-Orientations with Few Transitive Edges
- Graph classes and forbidden patterns on three vertices
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- A short note on undirected Fitch graphs
- Linear-time recognition of double-threshold graphs
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Combining decomposition approaches for the maximum weight stable set problem
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Polar graphs and maximal independent sets
- Weighted independent sets in classes of \(P_6\)-free graphs
- The clique operator on cographs and serial graphs
- Minimal triangulations of graphs: a survey
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
- Labelled induced subgraphs and well-quasi-ordering
- Speeding up Graph Algorithms via Switching Classes
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- The recognition of triangle graphs
- Offensive alliances in graphs
- Interval decomposition lattices are balanced
- Dominance drawings for DAGs with bounded modular width
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Linear-time modular decomposition of directed graphs
- Path-bicolorable graphs. (Extended abstract)
- Minimal separators in extended \(P_4\)-laden graphs
- Recognizing \(k\)-equistable graphs in FPT time
- Into the square: on the complexity of some quadratic-time solvable problems
- Comparability digraphs: an analogue of comparability graphs
- Independent set under a change constraint from an initial solution
- On algorithms for (P₅, gem)-free graphs
- Simple DFS on the complement of a graph and on partially complemented digraphs
- scientific article; zbMATH DE number 1508917 (Why is no real title available?)
- Note on the homogeneous set sandwich problem
- 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
- Weighted independent sets in a subclass of P₆-free graphs
- Computing and listing avoidable vertices and paths
- Solving some NP-complete problems using split decomposition
- Simple extensions of combinatorial structures
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- On the kernel and related problems in interval digraphs
- Minimal separators in \(P_4\)-tidy graphs
- 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
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Computing well-covered vector spaces of graphs using modular decomposition
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)
