4865 search results - page 70 / 973 » The Complexity of Graph Connectivity |
136
Voted
JCT
2010
15 years 1 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
131
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
140
Voted
IADIS
2004
15 years 4 months ago
2004
The main objective of the CONNECT project is to develop an innovative pedagogical framework that attempts to blend formal and informal learning, proposing an educational reform to ...
115
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
135
Voted
WG
2001
Springer
15 years 7 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...