Sciweavers

3204 search results - page 95 / 641
» The Alcuin Number of a Graph
Sort
View
ADHOCNOW
2005
Springer
14 years 1 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 6 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
ICPR
2004
IEEE
14 years 9 months ago
Outlier Detection Using k-Nearest Neighbour Graph
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
Ismo Kärkkäinen, Pasi Fränti, Ville...
ENDM
2000
131views more  ENDM 2000»
13 years 8 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar