3008 search results - page 234 / 602 » Independence in connected graphs |
192
click to vote
IM
2007
15 years 6 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
188
click to vote
JCO
2007
15 years 6 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
186
Voted
IFIP12
2009
15 years 4 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
148
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
170
click to vote
INFOCOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...