The following pages link to Bipartite permutation graphs (Q1092931):
Displaying 50 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Visibility graphs of towers (Q676570) (← links)
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Acyclic domination on bipartite permutation graphs (Q845701) (← links)
- The rook problem on saw-toothed chessboards (Q847376) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Line directionality of orders (Q1311417) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
