1951 search results - page 33 / 391 » An algorithm for improving graph partitions |
102
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
CASES
2007
ACM
15 years 2 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
SC
2005
ACM
15 years 3 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...