scientific article
From MaRDI portal
Publication:3797233
zbMath0652.05055MaRDI QIDQ3797233
P. A. Kamula, Derek Gordon Corneil
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs ⋮ Dominations in trapezoid graphs ⋮ Computing a dominating pair in an asteroidal triple-free graph in linear time ⋮ Parallel algorithms for the domination problems in trapezoid graphs ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ Max point-tolerance graphs ⋮ A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs ⋮ Trapezoid graphs and their coloring ⋮ Tangent circle graphs and `orders' ⋮ On the structure of trapezoid graphs ⋮ Recognizing simple-triangle graphs by restricted 2-chain subgraph cover ⋮ A recognition algorithm for simple-triangle graphs ⋮ Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ Linear-Interval Dimension and PI Orders ⋮ A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs ⋮ An efficient algorithm to solve the conditional covering problem on trapezoid graphs ⋮ Asteroidal triple-free graphs ⋮ On linear and circular structure of (claw, net)-free graphs ⋮ Donation center location problem ⋮ The recognition of triangle graphs ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Connected domination and dominating clique in trapezoid graphs ⋮ Counting independent sets in a tolerance graph ⋮ A linear time algorithm to compute a dominating path in an AT-free graph ⋮ Linear time algorithms for dominating pairs in asteroidal triple-free graphs ⋮ A linear time algorithm to construct a tree 4-spanner on trapezoid graphs ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ Vertex splitting and the recognition of trapezoid graphs ⋮ Counting the number of vertex covers in a trapezoid graph ⋮ The hub number of co-comparability graphs ⋮ A vertex ordering characterization of simple-triangle graphs ⋮ Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs ⋮ The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial ⋮ Efficient maximum matching algorithms for trapezoid graphs
This page was built for publication:
