5889 search results - page 395 / 1178 » Graph Layout Problems |
228
click to vote
ICDM
2006
IEEE
16 years 27 days ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
158
click to vote
ESA
2004
Springer
16 years 7 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
200
click to vote
SIGDOC
2000
ACM
15 years 11 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
170
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
157
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...