Pages that link to "Item:Q1902905"

The following pages link to On powers of \(m\)-trapezoid graphs (Q1902905):

Displaying 17 items.

• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
• Approximation of RNA multiple structural alignment (Q655441) (← links)
• Duchet-type theorems for powers of HHD-free graphs (Q1377865) (← links)
• Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
• On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
• A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)
• Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
• Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs (Q2445238) (← links)
• Graphs whose complement and square are isomorphic (Q2449164) (← links)
• The hub number of co-comparability graphs (Q2514123) (← links)
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
• How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
• (Q5009468) (← links)
• An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)