4865 search results - page 180 / 973 » The Complexity of Graph Connectivity |
106
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...
121
Voted
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure called a Goal Graph is constructed to rep...
139
Voted
WG
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
130
Voted
CGVR
2008
15 years 5 months ago
2008
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
138
click to vote
JGT
2010
15 years 2 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...