Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph triangulation
Description:
The addition of edges to a graph to make it chordal, often used in probabilistic inference and graph algorithms.
Primary topic:
Advanced Graph Theory Research (50%)
Related topics:
Advanced Graph Theory Research (50%),
Bayesian Modeling and Causal Inference (11%),
Complexity and Algorithms in Graphs (9%)
OpenAlex ID:
keywords/graph-triangulation
Network Filtering for Big Data: Triangulated Maximally Filtered Graph
2016
·
Guido Previde Massara
, T. Di Matteo
, et al.
·
Journal of Complex Networks
·
304
From Influence Diagrams to Junction Trees
1994
·
Frank Jensen
, Finn V. Jensen
, et al.
·
Elsevier eBooks
·
245
Minimal triangulations of graphs: A survey
2006
·
Pinar Heggernes
·
Discrete Mathematics
·
212
PDF
Massive graph triangulation
2013
·
Xiaocheng Hu
, Yufei Tao
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
140
On triangulation-based dense neighborhood graph discovery
2010
·
Nan Wang
, Jingbo Zhang
, et al.
·
Proceedings of the VLDB Endowment
·
132
Efficient Approximation for Triangulation of Minimum Treewidth
2013
·
Amir, Eyal
·
arXiv (Cornell University)
·
129
PDF
Triangulating Vertex-Colored Graphs
1994
·
F. R. McMorris
, Tandy J. Warnow
, et al.
·
SIAM Journal on Discrete Mathematics
·
85
Subexponential Parameterized Algorithm for Minimum Fill-In
2013
·
Fedor V. Fomin
, Yngve Villanger
·
SIAM Journal on Computing
·
83
PDF
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
1976
·
Tatsuo Ohtsuki
, Lap Kit Cheung
, et al.
·
Journal of Mathematical Analysis and Applications
·
77
OPT: a new framework for overlapped and parallel triangulation in large-scale graphs
2014
·
Jinha Kim
, Wook-Shin Han
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
72
The Minimum Degree Heuristic and the Minimal Triangulation Process
2003
·
Anne Berry
, Pinar Heggernes
, et al.
·
Lecture notes in computer science
·
69
PDF
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
2000
·
Assaf Natanzon
, Ron Shamir
, et al.
·
SIAM Journal on Computing
·
68
New lower bounds for bin packing problems with conflicts
2010
·
Ali Khanafer
, François Clautiaux
, et al.
·
European Journal of Operational Research
·
63
Triangulating graphs without asteroidal triples
1996
·
Rolf H. Möhring
·
Discrete Applied Mathematics
·
61
PDF
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
1999
·
Xin He
, Ming-Yang Kao
, et al.
·
SIAM Journal on Discrete Mathematics
·
60
PDF
Heuristic algorithms for the triangulation of graphs
1995
·
Andrés Cano
, Serafín Moral
·
Lecture notes in computer science
·
60
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
2014
·
Yujun Yang
, Douglas J. Klein
·
Discrete Applied Mathematics
·
59
PDF
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
2003
·
Nicolas Bonichon
, Cyril Gavoille
, et al.
·
Lecture notes in computer science
·
47
A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
1996
·
Frank Hoffmann
, Klaus Kriegel
·
SIAM Journal on Discrete Mathematics
·
45
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
1976
·
Tatsuo Ohtsuki
·
SIAM Journal on Computing
·
44
A wide-range efficient algorithm for minimal triangulation
1999
·
Anne Berry
·
Symposium on Discrete Algorithms
·
37
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
1993
·
H. Bodlaender
, T. Kloks
·
Journal of Algorithms
·
36
Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
1994
·
Jue Xue
·
Networks
·
35
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
2012
·
GUANTAO CHEN
, HAN REN
, et al.
·
Combinatorics Probability Computing
·
34
A polynomial approximation algorithm for the minimum fill-in problem
1998
·
Assaf Natanzon
, Ron Shamir
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
34
Show more works
View as search
Works count:
135
Citation count:
2,897
Year
Topic
Type