On Comparability and Permutation Graphs
From MaRDI portal
Publication:3685215
Recommendations
- scientific article; zbMATH DE number 4043898
- On permutation graphs
- On some algorithms and properties of comparability graphs
- scientific article; zbMATH DE number 966717
- On combination and permutation graphs
- scientific article; zbMATH DE number 1457239
- A note on comparison theorems for graphs
- Comparability graphs among cover-incomparability graphs
- scientific article; zbMATH DE number 2076912
- scientific article; zbMATH DE number 434480
Cited in
(83)- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Treelike comparability graphs
- An algorithm for minimizing setups in precedence constrained scheduling
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- Bipartite permutation graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Representations of graphs and networks (coding, layouts and embeddings)
- The interval inclusion number of a partially ordered set
- Cycle-free partial orders and chordal comparability graphs
- Transitive closure for restricted classes of partial orders
- Finding large holes
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- The weighted maximum independent set problem in permutation graphs
- \(P_ 4\)-trees and substitution decomposition
- Maximum \(k\)-covering of weighted transitive graphs with applications
- Circular permutation graph family with applications
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
- Modular decomposition and transitive orientation
- Parallel algorithms for permutation graphs
- A theorem on permutation graphs with applications
- Primitive 2-structures with the (n-2)-property
- A k-structure generalization of the theory of 2-structures
- On the feedback vertex set problem in permutation graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- An NC algorithm for the clique cover problem in cocomparability graphs and its application
- Stage-graph representations
- Optimal channel allocation for several types of cellular radio networks
- Weighted domination of cocomparability graphs
- Planar stage graphs: Characterizations and applications
- Drawing and encoding two-dimensional posets
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Parallel \(N\)-free order recognition
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- A note on transitive orientations with maximum sets of sources and sinks
- Coloring permutation graphs in parallel
- FO model checking on geometric graphs
- Finding a maximum matching in a permutation graph
- On the structure of trapezoid graphs
- The parity path problem on some subclasses of perfect graphs
- On \(k\)-tree containment graphs of paths in a tree
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Characterization of 2-path signed network
- Graphs whose complement and square are isomorphic
- Minimal comparability completions of arbitrary graphs
- Algorithmic combinatorics based on slicing posets
- Fair allocation of indivisible items with conflict graphs
- Linear-time algorithms for maximum sets of sources and sinks
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- On the performance of the first-fit coloring algorithm on permutation graphs
- O(m n) split decomposition of strongly connected graphs
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
- Generate all maximal independent sets in permutation graphs
- scientific article; zbMATH DE number 1554932 (Why is no real title available?)
- On comparability of bigrassmannian permutations
- Treewidth and pathwidth of permutation graphs
- A tight lower bound for primitivity in k-structures
- Optimal shooting: Characterizations and applications
- Distance approximating spanning trees
- Testing superperfection of k-trees
- Bipartite Analogues of Comparability and Cocomparability Graphs
- scientific article; zbMATH DE number 2230220 (Why is no real title available?)
- Graph isomorphism restricted by lists
- On some algorithms and properties of comparability graphs
- The firebreak problem
- Approximating the bandwidth for asteroidal triple-free graphs
- Efficient parallel modular decomposition (extended abstract)
- Comparability digraphs: an analogue of comparability graphs
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Weighted domination on cocomparability graphs
- On the Weisfeiler-Leman dimension of permutation graphs
- On-line recognition of interval graphs in O(m+n n) time
- Contiguity orders
- Parallel interval order recognition and construction of interval representations
- Hamiltonian path in permutation graphs
- Characterization and enumeration of 3-regular permutation graphs
- The complexity of transitively orienting temporal graphs
- A new approach for the domination problem on permutation graphs
- A relation between the comparability graph and the number of linear extensions
- Finding a maximum independent set in a permutation graph
- On probe permutation graphs
- \(O(m\log n)\) split decomposition of strongly-connected graphs
This page was built for publication: On Comparability and Permutation Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685215)
