1736 search results - page 81 / 348 » The rank-width of Directed Graphs |
146
click to vote
VIP
2000
15 years 5 months ago
2000
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
138
click to vote
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
138
Voted
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
128
click to vote
ASWEC
2004
IEEE
15 years 7 months ago
2004
IEEE
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
155
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...