Sciweavers

3471 search results - page 252 / 695
» Obstacle Numbers of Graphs
Sort
View
SOSYM
2010
107views more  SOSYM 2010»
15 years 4 months ago
A UML/OCL framework for the analysis of graph transformation rules
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, to...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
15 years 4 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 3 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
CATS
2006
15 years 7 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
SIAMDM
1998
55views more  SIAMDM 1998»
15 years 5 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu