Pages that link to "Item:Q5602691"
From MaRDI portal
The following pages link to Transitive Orientation of Graphs and Identification of Permutation Graphs (Q5602691):
Displaying 50 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Exploring the concept of perfection in 3-hypergraphs (Q299076) (← links)
- On containment graphs of paths in a tree (Q324771) (← links)
- Transitive oriented 3 hypergraphs of cyclic orders (Q382898) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On probe permutation graphs (Q967305) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- Stack sortable permutations (Q1170191) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- A condition for a family of triangles to be orientable to a cyclic order (Q1182579) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← 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)
- Constructing a stochastic critical path network given the slacks: Representation (Q1196917) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
- Acyclic orientations of a graph and the chromatic and independence numbers (Q1227749) (← links)
- Operations on permutations and representation in graph form (Q1233876) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- Algorithms on clique separable graphs (Q1246434) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
