Pages that link to "Item:Q4124209"

The following pages link to Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209):

Displayed 50 items.

• Representing triangulated graphs in stars (Q1261172) ‎ (← links)
• A chordal preconditioner for large-scale optimization (Q1262220) ‎ (← links)
• An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) ‎ (← links)
• Minimal vertex separators of chordal graphs (Q1281392) ‎ (← links)
• On the consecutive ones property (Q1281779) ‎ (← links)
• Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) ‎ (← links)
• The forbidden subgraph characterization of directed vertex graphs (Q1297413) ‎ (← links)
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) ‎ (← links)
• On constructing the elimination tree (Q1314332) ‎ (← links)
• On cocolourings and cochromatic numbers of graphs (Q1315460) ‎ (← links)
• The maximum clique problem (Q1318271) ‎ (← links)
• Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) ‎ (← links)
• Arboricity and bipartite subgraph listing algorithms (Q1334644) ‎ (← links)
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) ‎ (← links)
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) ‎ (← links)
• New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) ‎ (← links)
• Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) ‎ (← links)
• \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) ‎ (← links)
• Separators and structure prediction in sparse orthogonal factorization (Q1361831) ‎ (← links)
• LexBFS-orderings and powers of chordal graphs (Q1363684) ‎ (← links)
• Cuts, matrix completions and graph rigidity (Q1365058) ‎ (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) ‎ (← links)
• On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) ‎ (← links)
• Separability generalizes Dirac's theorem (Q1392561) ‎ (← links)
• On linear and circular structure of (claw, net)-free graphs (Q1406025) ‎ (← links)
• Interval degree and bandwidth of a graph (Q1406031) ‎ (← links)
• Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) ‎ (← links)
• Matrix completions and chordal graphs (Q1412950) ‎ (← links)
• Hereditary dominating pair graphs (Q1421473) ‎ (← links)
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) ‎ (← links)
• A practical algorithm for making filled graphs minimal (Q1589427) ‎ (← links)
• On vertex ranking of a starlike graph (Q1603539) ‎ (← links)
• An implementation of the iterative proportional fitting procedure by propagation trees. (Q1606471) ‎ (← links)
• Perfect edge domination and efficient edge domination in graphs (Q1613347) ‎ (← links)
• On claw-free asteroidal triple-free graphs (Q1613398) ‎ (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) ‎ (← links)
• Tree decompositions with small cost (Q1764801) ‎ (← links)
• On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) ‎ (← links)
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) ‎ (← links)
• A characterization of graphs with interval two-step graphs (Q1805321) ‎ (← links)
• Chromatic numbers of competition graphs (Q1805322) ‎ (← links)
• Recognition of some perfectly orderable graph classes (Q1811119) ‎ (← links)
• On the semi-perfect elimination (Q1825204) ‎ (← links)
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) ‎ (← links)
• Recognition of perfect elimination bipartite graphs (Q1836480) ‎ (← links)
• Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) ‎ (← links)
• Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) ‎ (← links)
• A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) ‎ (← links)
• Quasi-threshold graphs (Q1923584) ‎ (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) ‎ (← links)