Searching for "Connectivity of distance graphs." – sorted by Relevance.
-
Bounds on the quality of approximate solutions to the Group Steiner Problem
- . For an undirected, connected distance graph with groups of required vertices and Steiner vertices, GSP asks for a
- Cited by 17 (3 self) – Add To MetaCart
-
The Complexity of Approximating the Class Steiner Tree Problem
- a connected, undirected distance graph with required classes of nodes and optional Steiner nodes
- Cited by 8 (1 self) – Add To MetaCart
-
Recent Results in Automatic Web Resource Discovery
- and distances in graphs, with diverse applications like epidemiology, espionage, citation indexing, etc
- Cited by 16 (0 self) – Add To MetaCart
-
Gathering of asynchronous robots with limited visibility
- , then r can not move on Γ below s(t) in one cycle. 4.2 Preserved Connectivity The initial distance graph D
- Cited by 8 (2 self) – Add To MetaCart
-
Reformulating Temporal Plans For Efficient Execution
- the example started with Figure 1, Figure 6 represents the fully connected distance graph obtained after
- Cited by 40 (9 self) – Add To MetaCart
-
Visualizing Association Mining Results through Hierarchical Clusters
- of pairwise distances. Mathematically, distances for all document pairs correspond to a fully connected
- Add To MetaCart
-
Average-clicks: A New Measure of Distance on the World Wide Web
- network theory is concerned with properties related to connectivity and distance in graphs (Chakrabarti
- Add To MetaCart
-
MirrorSEEk System Architecture
- on social network theory which is concerned with connectivity and distance in graphs, [40] provides
- Add To MetaCart
-
Finitely-Oriented Shortest Paths in the Presence of Polygonal Obstacles
- to model the situation in the plane by a weighted, undirected distance graph and to solve or approximate
- Cited by 1 (0 self) – Add To MetaCart

