1199 search results - page 147 / 240 » Graph Theory |
136
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
110
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents the Visual Threat Awareness (VISTA) system for real time collision obstacle detection for an unmanned air vehicle (UAV). Computational stereo performance ha...
137
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
173
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
132
click to vote
EUROCOLT
1995
Springer
15 years 7 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...