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.
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Decomposition of structural learning about directed acyclic graphs (Q2457633) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- Subclasses of \(k\)-trees: characterization and recognition (Q2489905) (← links)
- Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions (Q2492856) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- Sparse matrix factor modification in structural reanalysis (Q3343586) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- Decomposable Probabilistic Influence Diagrams (Q3416009) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Simple vertex ordering characterizations for graph search (Q3439379) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées (Q3789083) (← links)
- The General Minimum Fill-In Problem (Q3802913) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- Computing the Minimum Fill-In is NP-Complete (Q3960122) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- Triangulation of Bayesian networks by retriangulation (Q4419295) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- On the existence of convex decompositions of partially separable functions (Q5186653) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Minimal elimination ordering for graphs of bounded degree (Q5957302) (← links)