4865 search results - page 244 / 973 » The Complexity of Graph Connectivity |
137
click to vote
RR
2007
Springer
15 years 11 months ago
2007
Springer
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
214
Voted
FOCS
2000
IEEE
15 years 9 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...
160
Voted
IICS
2010
Springer
15 years 8 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...
150
Voted
CCCG
2010
15 years 6 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...
140
Voted
COMBINATORICS
2000
15 years 4 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 ...