9532 search results - page 312 / 1907 » Logic, Graphs, and Algorithms |
175
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
174
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
138
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
157
click to vote
WG
2007
Springer
16 years 23 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
231
click to vote
PKDD
2004
Springer
16 years 23 hour ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...