3268 search results - page 123 / 654 » The hub number of a graph |
144
click to vote
CPC
2007
15 years 6 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...
141
click to vote
CORR
2010
Springer
15 years 6 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...
159
click to vote
ICPR
2004
IEEE
16 years 7 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 ...
182
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
182
click to vote
VLC
2002
15 years 6 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...