Sciweavers

646 search results - page 71 / 130
» Generalized connected domination in graphs
Sort
View
ISPA
2004
Springer
14 years 2 months ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu
DEBU
2010
180views more  DEBU 2010»
13 years 8 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 8 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
GC
2006
Springer
13 years 8 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
GIS
2010
ACM
13 years 6 months ago
Querying geo-social data by bridging spatial networks and social networks
Recording the location of people using location-acquisition technologies, such as GPS, allows generating life patterns, which associate people to places they frequently visit. Con...
Yerach Doytsher, Ben Galon, Yaron Kanza