214 search results - page 11 / 43 » The node capacitated graph partitioning problem: A computati... |
110
Voted
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
99
Voted
DAC
2005
ACM
16 years 1 months ago
2005
ACM
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...
123
Voted
IV
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
100
click to vote
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
103
Voted
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...