Pages that link to "Item:Q4124209"
From MaRDI portal
The following pages link to Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209):
Displayed 50 items.
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Positive definite completions of partial Hermitian matrices (Q798738) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model (Q1078976) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Efficient solutions of hierarchical systems of linear equations (Q1089723) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- Chordal graph recognition is in NC (Q1108003) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- Sparse linear problems and the least squares method (Q1110269) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) (Q1114300) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- On symbolic factorization of partitioned sparse symmetric matrices (Q1152199) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- Optimal packing and covering in the plane are NP-complete (Q1157170) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- Inheritance principles for chordal graphs (Q1173947) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- Finding large holes (Q1182105) (← links)
- An inertia formula for Hermitian matrices with sparse inverses (Q1183205) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)