Pages that link to "Item:Q4312224"

The following pages link to On the 2-Chain Subgraph Cover and Related Problems (Q4312224):

Displaying 28 items.

• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
• Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
• Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
• The recognition of triangle graphs (Q441856) (← links)
• Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
• Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
• The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
• Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
• A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
• On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
• A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
• A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
• An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
• Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
• An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308) (← links)
• Linear-Interval Dimension and PI Orders (Q3503538) (← links)
• An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
• The lexicographic method for the threshold cover problem (Q5925705) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
• Intersection of chordal graphs and some related partition problems (Q6657232) (← links)