2125 search results - page 145 / 425 » On Graph Complexity |
142
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
153
click to vote
HCW
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
173
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
187
click to vote
OPODIS
2001
15 years 7 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
147
click to vote
FCT
2009
Springer
16 years 29 days ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...