202 search results - page 18 / 41 » Large-Girth Roots of Graphs |
111
click to vote
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
52
Voted
IPL
2006
14 years 9 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
CCE
2008
14 years 9 months ago
2008
We review the use of bond graphs for modeling of physico-chemical processes. We recall that bond graphs define a circuit-type language which root on a thermodynamical consistent d...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...