Pages that link to "Item:Q1060229"

The following pages link to Interval graphs and related topics (Q1060229):

Displaying 25 items.

• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• Parallel interval order recognition and construction of interval representations (Q673637) (← links)
• Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
• Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
• Intersection graphs of halflines and halfplanes (Q1106247) (← links)
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
• Paths in interval graphs and circular arc graphs (Q1210553) (← links)
• Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
• A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
• New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
• Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
• Completeness for intersection classes (Q1584399) (← links)
• Representing digraphs using intervals or circular arcs (Q1910520) (← links)
• Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
• Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
• Block matrix models for dynamic networks (Q2242768) (← links)
• Characterization of the graphs with boxicity \(\leq 2\) (Q2277492) (← links)
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
• Paired domination on interval and circular-arc graphs (Q2384392) (← links)
• Succinct encodings for families of interval graphs (Q2661990) (← links)
• Preference structures and threshold models (Q4863877) (← links)
• Difference graphs (Q5907056) (← links)
• Exactly hittable interval graphs (Q6599815) (← links)
• Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)