Pages that link to "Item:Q3675541"
From MaRDI portal
The following pages link to Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3675541):
Displaying 21 items.
- Certifying algorithms (Q465678) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- On split-coloring problems (Q995923) (← links)
- Inferring multivalued dependencies from functional and join dependencies (Q1168088) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- Paired threshold graphs (Q1801073) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- End vertices of graph searches on bipartite graphs (Q2234808) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
- (Q2925638) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- (Q4917827) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
