Sciweavers

620 search results - page 32 / 124
» The edge-flipping group of a graph
Sort
View
AISS
2010
161views more  AISS 2010»
13 years 6 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
IFIP12
2007
13 years 10 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
ICBA
2004
Springer
271views Biometrics» more  ICBA 2004»
14 years 2 months ago
Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
Sanqiang Zhao, Wen Gao, Shiguang Shan, Baocai Yin
CIKM
2009
Springer
14 years 27 days ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
JCT
2007
133views more  JCT 2007»
13 years 8 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky