5473 search results - page 68 / 1095 » On the graph isomorphism problem |
127
click to vote
LATIN
1995
Springer
15 years 3 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
GD
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
110
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
111
click to vote
WWW
2003
ACM
16 years 17 days ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...