4865 search results - page 143 / 973 » The Complexity of Graph Connectivity |
JUCS
2007
13 years 10 months ago
2007
: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from ...
TEDU
2011
13 years 5 months ago
2011
In the era of distributed digital media, technology is moving to the background and interoperability between devices increases. The handles for users to explore, make and break con...
APVIS
2009
13 years 12 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
COCOON
2003
Springer
14 years 4 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
ARSCOM
2004
13 years 10 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...