5889 search results - page 394 / 1178 » Graph Layout Problems |
177
Voted
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
188
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
182
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
189
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
187
click to vote
IEEEARES
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...