Pages that link to "Item:Q1183454"

The following pages link to Linear time algorithms on circular-arc graphs (Q1183454):

Displaying 45 items.

• Refined algorithms for hitting many intervals (Q344570) (← links)
• Max point-tolerance graphs (Q344833) (← links)
• Algorithms for interval structures with applications (Q388095) (← links)
• Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
• Optimization problems in dotted interval graphs (Q400519) (← links)
• Minimum vertex cover in rectangle graphs (Q551504) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• On the complete width and edge clique cover problems (Q721937) (← links)
• A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
• Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
• Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
• Algorithms for finding clique-transversals of graphs (Q940841) (← links)
• Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
• Linear-time recognition of circular-arc graphs (Q1424251) (← links)
• Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
• Power domination in circular-arc graphs (Q1939660) (← links)
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
• New results on induced matchings (Q1975379) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
• Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• Large-scale clique cover of real-world networks (Q2288213) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Capacitated Arc Stabbing (Q2376793) (← links)
• On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
• Exact algorithms for weak Roman domination (Q2413969) (← links)
• Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
• Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2840712) (← links)
• Clique Cover and Graph Separation (Q2943572) (← links)
• Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
• Algorithms for Interval Structures with Applications (Q3004669) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
• Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
• A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611) (← links)
• (Q4601878) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
• Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) (← links)
• Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)