4865 search results - page 194 / 973 » The Complexity of Graph Connectivity |
130
Voted
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...
120
Voted
DLT
2006
15 years 5 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
149
click to vote
GC
2008
Springer
15 years 3 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
166
click to vote
ACID
2006
15 years 5 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
112
click to vote
ADG
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...