4865 search results - page 580 / 973 » The Complexity of Graph Connectivity |
194
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
161
click to vote
DEXAW
2004
IEEE
15 years 10 months ago
2004
IEEE
The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies which enable the ...
196
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
181
Voted
AIPS
2008
15 years 9 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
168
click to vote
ICCSA
2010
Springer
15 years 8 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...