Pages that link to "Item:Q4124209"
From MaRDI portal
The following pages link to Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209):
Displaying 50 items.
- 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)
- On the proper orientation number of chordal graphs (Q820574) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← 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)
- A tie-break model for graph search (Q896657) (← links)
- High dimensional posterior convergence rates for decomposable graphical models (Q902216) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Two methods for the generation of chordal graphs (Q940844) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Minimal split completions (Q967310) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← 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)
