Sciweavers

1664 search results - page 59 / 333
» Distance labeling in graphs
Sort
View
DISOPT
2010
129views more  DISOPT 2010»
14 years 12 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
FLAIRS
2007
15 years 2 months ago
Inference of Edge Replacement Graph Grammars
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
WWW
2009
ACM
16 years 16 days ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
ACTA
2005
96views more  ACTA 2005»
14 years 11 months ago
Families of automata characterizing context-sensitive languages
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
Christophe Morvan, Chloe Rispal
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 4 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...