Sciweavers

4865 search results - page 171 / 973
» The Complexity of Graph Connectivity
Sort
View
MOBIHOC
2002
ACM
16 years 3 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
ENTCS
2008
85views more  ENTCS 2008»
15 years 3 months ago
Connectivity Properties of Dimension Level Sets
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
Jack H. Lutz, Klaus Weihrauch
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 3 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
JGAA
2008
100views more  JGAA 2008»
15 years 3 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
168
Voted
PVLDB
2008
167views more  PVLDB 2008»
15 years 1 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...