Pages that link to "Item:Q678864"

The following pages link to Trapezoid graphs and generalizations, geometry and algorithms (Q678864):

Displaying 34 items.

• Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
• Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
• The recognition of triangle graphs (Q441856) (← links)
• Approximation of RNA multiple structural alignment (Q655441) (← links)
• Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
• Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
• Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
• Approximating the 2-interval pattern problem (Q932323) (← links)
• Unit and proper tube orders (Q953272) (← links)
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem (Q996823) (← links)
• Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
• Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
• Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
• Algorithms for maximum weight induced paths (Q1603504) (← links)
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
• On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
• Donation center location problem (Q1949758) (← links)
• On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
• New results on induced matchings (Q1975379) (← links)
• A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
• Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
• An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
• On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
• Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
• 3D-interval-filament graphs (Q2462403) (← links)
• The hub number of co-comparability graphs (Q2514123) (← links)
• MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
• AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS (Q3150028) (← links)
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
• Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
• Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
• On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
• No-Wait Scheduling for Locks (Q5139604) (← links)