Bipartite permutation graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3900817 (Why is no real title available?)
- scientific article; zbMATH DE number 3943870 (Why is no real title available?)
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3310759 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Computing the Minimum Fill-In is NP-Complete
- Domination in permutation graphs
- Finding minimum dominating cycles in permutation graphs
- Graph theory
- Hamilton Paths in Grid Graphs
- On Comparability and Permutation Graphs
- On testing isomorphism of permutation graphs
- Permutation Graphs and Transitive Graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The NP-completeness column: An ongoing guide
- The NP-completeness column: An ongoing guide
- The NP-completeness column: an ongoing guide
- The complexity of comparability graph recognition and coloring
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Mutual placement of bipartite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A polynomial time algorithm for longest paths in biconvex graphs
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Posets and VPG graphs
- Ferrers dimension of grid intersection graphs
- HAMILTONian circuits in chordal bipartite graphs
- Bandwidth of convex bipartite graphs and related graphs
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- The maximum binary tree problem
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- A faster fixed parameter algorithm for two-layer crossing minimization
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Parallel algorithms for permutation graphs
- On the recognition of permuted bottleneck Monge matrices
- Efficient parallel algorithms for doubly convex-bipartite graphs
- A new approach for the domination problem on permutation graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Linear structure of bipartite permutation graphs and the longest path problem
- The Maximum Binary Tree Problem.
- Labelled well-quasi-order for permutation classes
- On list \(k\)-coloring convex bipartite graphs
- Generate all maximal independent sets in permutation graphs
- Computing the cutwidth of bipartite permutation graphs in linear time
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Visibility graphs of towers
- On factorial properties of chordal bipartite graphs
- Permuting matrices to avoid forbidden submatrices
- Parikh word representability of bipartite permutation graphs
- Induced matchings in asteroidal triple-free graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Random generation and enumeration of bipartite permutation graphs
- Permutation bigraphs and interval containments
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Acyclic domination on bipartite permutation graphs
- On orthogonal ray graphs
- Efficient parallel algorithms for bipartite permutation graphs
- Random Generation and Enumeration of Bipartite Permutation Graphs
- Biconvex graphs: Ordering and algorithms
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- How to use the minimal separators of a graph for its chordal triangulation
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- Bandwidth of bipartite permutation graphs in polynomial time
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- A linear edge kernel for two-layer crossing minimization
- Labeling bipartite permutation graphs with a condition at distance two
- Cyclability in graph classes
- Weighted efficient domination problem on some perfect graphs
- On the OBDD representation of some graph classes
- Rainbow vertex coloring bipartite graphs and chordal graphs
- Perspectives of Monge properties in optimization
- Efficient parallel recognition of some circular arc graphs. II
- Finding a maximum independent set in a permutation graph
- Interval \(k\)-graphs and orders
- Minimal classes of graphs of unbounded clique-width
- Canonical antichains of unit interval and bipartite permutation graphs
- Triangulating multitolerance graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- On domination problems for permutation and other graphs
- On computing longest paths in small graph classes
- scientific article; zbMATH DE number 4063153 (Why is no real title available?)
- A dichotomy for minimum cost graph homomorphisms
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- On edge perfectness and classes of bipartite graphs
- The weighted maximum independent set problem in permutation graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Recognizing interval digraphs and interval bigraphs in polynomial time
- A polynomial kernel for bipartite permutation vertex deletion
- Partitioning graphs into Hamiltonian ones
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Path eccentricity of graphs
- Minimum cost homomorphisms with constrained costs
- Crossing Layout in Non-planar Graph Drawings
- Double-threshold permutation graphs
- Vertex deletion into bipartite permutation graphs
- On the approximability of average completion time scheduling under precedence constraints.
- The multicolored graph realization problem
- A theorem on permutation graphs with applications
- Graph classes and the switch Markov chain for matchings
- Permutation-exchange graphs that emulate the binary cube
- Bipartite Permutation Graphs Are Reconstructible
- On permutations avoiding partially ordered patterns defined by bipartite graphs
- Succinct permutation graphs
- Upper Clique Transversals in Graphs
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Vertex ordering with precedence constraints
- Impact of diameter and convex ordering for Hamiltonicity and domination
- A new lower bound for the bipartite crossing number with applications
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- Acyclic matchings in subclasses of bipartite graphs
- On the complexity of the maximum biplanar subgraph problem
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Critical properties of bipartite permutation graphs
This page was built for publication: Bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092931)
