1951 search results - page 29 / 391 » An algorithm for improving graph partitions |
101
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
CCCG
2010
14 years 11 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
CAD
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...