Sciweavers

2487 search results - page 50 / 498
» Partitions of Graphs into Trees
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
14 years 9 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner
ICPADS
1998
IEEE
14 years 1 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
EUROPAR
2004
Springer
14 years 2 months ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes
EJC
2008
13 years 9 months ago
Graph parameters and semigroup functions
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
László Lovász, Alexander Schr...