Pages that link to "Item:Q4877525"

The following pages link to Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs (Q4877525):

Displaying 50 items.

• On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
• Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• On the recognition of fuzzy circular interval graphs (Q408180) (← links)
• Coloring fuzzy circular interval graphs (Q412282) (← links)
• Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
• Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
• Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
• A superlocal version of Reed's conjecture (Q490262) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
• Extending partial representations of proper and unit interval graphs (Q524367) (← links)
• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
• Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
• Some remarks on the geodetic number of a graph (Q965962) (← links)
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
• Obstacle numbers of graphs (Q977184) (← links)
• The clique operator on circular-arc graphs (Q987670) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• On the computation of the hull number of a graph (Q1045055) (← links)
• A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
• Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
• A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
• A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
• Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
• Proper interval vertex deletion (Q1949742) (← links)
• A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
• Completing colored graphs to meet a target property (Q2030434) (← links)
• Total 2-domination of proper interval graphs (Q2043384) (← links)
• The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
• Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
• Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
• Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)