3008 search results - page 189 / 602 » Independence in connected graphs |
156
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
259
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
190
click to vote
IICS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract: The article presents a model of the structural properties of virtual communities and the information they can access. It argues that a large part of the information – a...
169
click to vote
CCCG
2010
15 years 8 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
168
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...