Sciweavers

1149 search results - page 67 / 230
» Minimally non-Pfaffian graphs
Sort
View
ICC
2007
IEEE
104views Communications» more  ICC 2007»
15 years 6 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
IJCNN
2007
IEEE
15 years 6 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 6 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
15 years 6 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
IFIP
2004
Springer
15 years 5 months ago
Selective Channel Scanning for Fast Handoff in Wireless LAN Using Neighbor Graph
: Handoff at the link layer 2 (L2) consists of three phases including scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time del...
Sang-Hee Park, Hye-Soo Kim, Chun-Su Park, Jae-Won ...