966 search results - page 45 / 194 » Small Alliances in Graphs |
112
Voted
PKDD
2005
Springer
15 years 7 months 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 ...
SIAMDM
2000
15 years 1 months ago
2000
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
106
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
102
click to vote
SSS
2009
Springer
15 years 8 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
WG
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...