Transitive Orientation of Graphs and Identification of Permutation Graphs

Cited in

(only showing first 100 items - show all)

Succinct permutation graphs
Algorithm for the vertex packing problem
Testing superperfection of k-trees
Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
Stage-graph representations
On the domination number of permutation graphs and an application to strong fixed points
Computation of diameter, radius and center of permutation graphs
Characterization of $\mathrm{B}_0$-VPG cocomparability graphs and a 2D visualization of their posets
On testing isomorphism of permutation graphs
Characterization and enumeration of 3-regular permutation graphs
The Complexity of the Partial Order Dimension Problem
A compact data structure and parallel algorithms for permutation graphs
Operations on permutations and representation in graph form
Parallel interval order recognition and construction of interval representations
An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
Coloration de graphes : fondements et applications
Representations of graphs and networks (coding, layouts and embeddings)
Permutation graphs and the weak Bruhat order
Vertex deletion into bipartite permutation graphs
Algorithms for maximumk-colorings andk-coverings of transitive graphs
Approximation of the double traveling salesman problem with multiple stacks
Domination in transitive colorings of tournaments
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
Parallel $N$-free order recognition
Planar stage graphs: Characterizations and applications
Maximum weightk-independent set problem on permutation graphs
On the Weisfeiler-Leman dimension of permutation graphs
String graphs. I: The number of critical nonstring graphs is infinite
Computing the all-pairs longest chains in the plane
Permutation graphs: Connected domination and Steiner trees
A polynomial-time algorithm for the paired-domination problem on permutation graphs
$k$-majority digraphs and the hardness of voting with a constant number of voters
The weighted maximum independent set problem in permutation graphs
On graphs associated to sets of rankings
Strengthened 0-1 linear formulation for the daily satellite mission planning
Hamiltonian path in permutation graphs
Lexicographic orientation algorithms
Minimum 2-tuple dominating set of permutation graphs
Partitioned probe comparability graphs
Coloring permutation graphs in parallel
On probe permutation graphs
On strict (outer-)confluent graphs
On strict (outer-)confluent graphs
New clique and independent set algorithms for circle graphs
A recognition algorithm for simple-triangle graphs
Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph
Minimum r-neighborhood covering set of permutation graphs
On the intersection of tolerance and cocomparability graphs
Cohen-Macaulay permutation graphs
An efficient algorithm to find next-to-shortest path on permutation graphs
On orientations and shortest paths
Multipermutations and Stirling multipermutations
Comparability graphs and intersection graphs
Hereditary dominating pair graphs
Finding a maximum independent set in a permutation graph
Modular decomposition and transitive orientation
Recent results on containment graphs of paths in a tree
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
On the performance of the first-fit coloring algorithm on permutation graphs
Exploring the concept of perfection in 3-hypergraphs
Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
Zur Vorgabe gerichteter Kanten von Vergleichbarkeitsgraphen
Transitive oriented 3 hypergraphs of cyclic orders
MaxCut on permutation graphs is NP‐complete
Generate all maximal independent sets in permutation graphs
Embedding linear orders in grids
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
Bipartite permutation graphs
Finding a maximum matching in a permutation graph
An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
A linear time algorithm for finding all hinge vertices of a permutation graph
Constructing a stochastic critical path network given the slacks: Representation
Solving the shortest-paths problem on bipartite permutation graphs efficiently
Connected permutation graphs
On domination problems for permutation and other graphs
Dominating sets in perfect graphs
Transitive closure for restricted classes of partial orders
Acyclic orientations of a graph and the chromatic and independence numbers
An algorithm for constructing edge-trees from hypergraphs
On the computational complexity of ordered subgraph recognition
Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
Parallel algorithms for permutation graphs
The complexity of comparability graph recognition and coloring
On the feedback vertex set problem in permutation graphs
On containment graphs of paths in a tree
Stack sortable permutations
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Thresholds for classes of intersection graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Comparability graphs and a new matroid
A recognition algorithm for the intersection graphs of paths in trees
On realizable biorders and the biorder dimension of a relation
Finding maximum cliques in circle graphs
Sorting by bounded block-moves
A new approach for the domination problem on permutation graphs
Double-threshold permutation graphs
Vertex deletion into bipartite permutation graphs
The mutual exclusion scheduling problem for permutation and comparability graphs.

This page was built for publication: Transitive Orientation of Graphs and Identification of Permutation Graphs

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