3471 search results - page 132 / 695 » Obstacle Numbers of Graphs |
GBRPR
2007
Springer
14 years 3 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
AINA
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
CPC
2007
13 years 9 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...