5473 search results - page 149 / 1095 » On the graph isomorphism problem |
223
click to vote
COR
2008
15 years 6 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
198
click to vote
MP
2007
15 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
163
Voted
AEI
2008
15 years 7 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
250
click to vote
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
142
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...