9532 search results - page 272 / 1907 » Logic, Graphs, and Algorithms |
159
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
169
click to vote
FAW
2009
Springer
16 years 1 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
149
click to vote
ISAAC
2007
Springer
16 years 22 days ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
182
click to vote
GBRPR
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
143
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...