9532 search results - page 323 / 1907 » Logic, Graphs, and Algorithms |
178
click to vote
PKDD
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
174
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
157
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
148
click to vote
CCCG
2006
15 years 8 months ago
2006
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
164
click to vote
ESA
2007
Springer
16 years 26 days ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...