Pages that link to "Item:Q1014413"

The following pages link to A linear time recognition algorithm for proper interval graphs (Q1014413):

Displaying 42 items.

• On the recognition of fuzzy circular interval graphs (Q408180) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
• Minimal proper interval completions (Q963366) (← links)
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
• Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
• Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
• Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
• Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
• Mathematical properties on the hyperbolicity of interval graphs (Q2333446) (← links)
• Perfect Roman domination in graphs (Q2333784) (← links)
• Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
• A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
• The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
• Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
• Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
• Acyclic matching in some subclasses of graphs (Q2680984) (← links)
• Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
• A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
• Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
• Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
• Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
• Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
• On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
• 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
• Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)