1545 search results - page 165 / 309 » On tree congestion of graphs |
EJC
2002
14 years 10 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
ENTCS
2011
14 years 5 months ago
2011
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
76
Voted
ICML
2003
IEEE
15 years 11 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
81
Voted
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
94
Voted
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...