4926 search results - page 265 / 986 » Two Graph Algorithms On an Associative Computing Model |
179
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
175
click to vote
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
203
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
138
click to vote
MFCS
2009
Springer
16 years 26 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
175
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...