2063 search results - page 23 / 413 » connection 2007 |
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
WG
2007
Springer
15 years 4 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
46
Voted
DM
2007
14 years 10 months ago
2007
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
ENDM
2007
14 years 10 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
ECSCW
2003
14 years 11 months ago
2003
This paper is about finding explicit and implicit connections between people by mining semantic associations from their email communications. Following from a sociocognitive stance...