Pages that link to "Item:Q3335007"
From MaRDI portal
The following pages link to Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007):
Displaying 50 items.
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Dynamic branching in qualitative constraint-based reasoning via counting local models (Q2051804) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Default reasoning using classical logic (Q2171265) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Latent association graph inference for binary transaction data (Q2242006) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
- Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Collective singleton-based consistency for qualitative constraint networks: theory and practice (Q2334596) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- An algorithm for determining minimal reduced-coverings of acyclic database schemes (Q2365507) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Decomposition of structural learning about directed acyclic graphs (Q2457633) (← links)
- Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions (Q2492856) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- Robustness to dependency in portfolio optimization using overlapping marginals (Q2797466) (← links)
- Bayesian Approaches for Large Biological Networks (Q2800194) (← links)
- On the power of graph searching for cocomparability graphs (Q2801333) (← links)
- Exploiting separators for guiding VNS (Q2840785) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
