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.
- A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Iterative proportional scaling via decomposable submodels for contingency tables (Q961221) (← links)
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme (Q961265) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- A note on minimal d-separation trees for structural learning (Q969533) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← 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)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Distributed revision of composite beliefs (Q1096412) (← links)
- Existence of extensions and product extensions for discrete probability distributions (Q1098477) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Chordal graph recognition is in NC (Q1108003) (← links)
- Interaction-free multivalued dependency sets (Q1111777) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Tree clustering for constraint networks (Q1116363) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Recognizing single-peaked preferences on a tree (Q1122456) (← links)
- Structural conditions for cycle completable graphs (Q1126192) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- Finding large holes (Q1182105) (← links)
- Temporal constraint networks (Q1182161) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- A characterization of finite fd-acyclicity (Q1264004) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Fast Bayes and the dynamic junction forest (Q1277771) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution (Q1311330) (← links)
- The maximum clique problem (Q1318271) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
