Pages that link to "Item:Q3685215"
From MaRDI portal
The following pages link to On Comparability and Permutation Graphs (Q3685215):
Displaying 50 items.
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Finding large holes (Q1182105) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Circular permutation graph family with applications (Q1208459) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615) (← links)
- Stage-graph representations (Q1363763) (← links)
- Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Drawing and encoding two-dimensional posets (Q1392206) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- The parity path problem on some subclasses of perfect graphs (Q1923620) (← links)
- On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
- Characterization of 2-path signed network (Q2221636) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- (Q2741377) (← links)
