Results 11 to 20 of about 28,286 (155)
Determining what sets of trees can be the clique trees of a chordal graph [PDF]
, 2011 Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is studied: given a family T of trees,
de Caria, Pablo Jesús +1 more
core +2 more sources
Nested Locally Hamiltonian Graphs and the Oberly-Sumner Conjecture
Discussiones Mathematicae Graph Theory, 2022 A graph G is locally 𝒫, abbreviated L𝒫, if for every vertex v in G the open neighbourhood N(v) of v is non-empty and induces a graph with property 𝒫. Specifically, a graph G without isolated vertices is locally connected (LC) if N(v) induces a connected ...
de Wet Johan P., Frick Marietjie
doaj +1 more source
The vertex leafage of chordal graphs [PDF]
, 2011 Every chordal graph $G$ can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\em tree model} of $G$. The leafage $\ell(G)$ of a connected chordal graph $G$ is the minimum number of leaves of the host tree ...
Buneman +19 more
core +1 more source
On-the-Fly Output Compression for Join-Based Graph Mining Algorithms
IEEE Access, 2018 Many join-based graph mining (JGM) algorithms, such as triangle listing and clique enumeration, typically output data of such a large size that it often dominates the mining cost.
Mostofa Kamal Rasel, Young-Koo Lee
doaj +1 more source
Surfaces, Tree-Width, Clique-Minors, and Partitions
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Guoli +3 more
openaire +1 more source
On finding minimum-diameter clique trees [PDF]
, 1991 It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances.
Blair +6 more
openaire +2 more sources
Isomorphism of graph classes related to the circular-ones property [PDF]
, 2012 We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gamma ...
Curtis, Andrew R. +6 more
core +4 more sources
A simple and space efficient segment tree implementation
MethodsX, 2019 The segment tree is an extremely versatile data structure. In this paper, a new array based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can be removed ...
Lei Wang, Xiaodong Wang
doaj +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
Linear rank-width and linear clique-width of trees [PDF]
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adler, Isolde, Kanté, Mamadou Moustapha
openaire +5 more sources