Sciweavers

1199 search results - page 20 / 240
» Graph Theory
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
15 years 26 days ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
GD
2006
Springer
15 years 6 months ago
Partitions of Graphs into Trees
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Therese C. Biedl, Franz-Josef Brandenburg
EJC
2010
15 years 2 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk
OHS
2000
Springer
15 years 6 months ago
Applying Computer Semiotics to Hypertext Theory and the World Wide Web
This paper introduces a Semiotic Appoach to Hypertext Theory. Having been applied to Informatics only in recent years, Semiotics promises a broader understanding of Hypertext as a ...
Moritz Neumüller
97
Voted
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar