Sciweavers

3396 search results - page 103 / 680
» Tree representations of graphs
Sort
View
CPC
2007
97views more  CPC 2007»
13 years 9 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
ICPR
2000
IEEE
14 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ACL
1998
13 years 10 months ago
A Flexible Example-Based Parser Based on the SSTC
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their represent...
Mosleh Hmoud Al-Adhaileh, Tang Enya Kong
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche