1734 search results - page 40 / 347 » its 2000 |
SIAMDM
2000
14 years 9 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
In the context of graphics recognition, arc detection consists in the extraction of circles and arcs from the image of a graphics document or from the segments yielded by its vect...
108
click to vote
FOCS
2000
IEEE
15 years 2 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...
62
Voted
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
73
Voted
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...