scholarly journals Computing a Clique Tree with the Algorithm Maximal Label Search

Algorithms ◽  
2017 ◽  
Vol 10 (1) ◽  
pp. 20
Author(s):  
Anne Berry ◽  
Geneviève Simonet
Keyword(s):  
Clique Tree

An extended approach for lifting clique tree inequalities

2013 ◽  
Vol 30 (3) ◽  
pp. 489-519 ◽  
Author(s):  
Anja Fischer ◽  
Frank Fischer
Keyword(s):  
Extended Approach ◽  
Clique Tree

scholarly journals A clique tree algorithm for partitioning a chordal graph into transitive subgraphs

1995 ◽  
Vol 223-224 ◽  
pp. 553-588 ◽  
Author(s):  
Barry W. Peyton ◽  
Alex Pothen ◽  
Xiaoqing Yuan
Keyword(s):  
Chordal Graph ◽  
Tree Algorithm ◽  
Clique Tree

scholarly journals Clique tree generalization and new subclasses of chordal graphs

2002 ◽  
Vol 117 (1-3) ◽  
pp. 109-131 ◽  
Author(s):  
P.Sreenivasa Kumar ◽  
C.E.Veni Madhavan
Keyword(s):  
Chordal Graphs ◽  
Clique Tree

scholarly journals Clique Trees of Infinite Locally Finite Chordal Graphs

10.37236/3928 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Christoph Hofer-Temmel ◽  
Florian Lehner
Keyword(s):  
Chordal Graph ◽  
Chordal Graphs ◽  
Locally Finite ◽  
Clique Trees ◽  
Clique Tree

We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees. This allows us to enumerate the clique trees of a chordal graph and extend various classic characterisations of clique trees to the infinite setting. 

Sign in / Sign up

Export Citation Format

Share Document