1545 search results - page 118 / 309 » On tree congestion of graphs |
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
115
click to vote
CAV
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
GD
2004
Springer
15 years 3 months ago
2004
Springer
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
DM
2008
14 years 10 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
JCT
2008
14 years 10 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...