1729 search results - page 212 / 346 » On Bounds for the k-Partitioning of Graphs |
183
click to vote
MFCS
2007
Springer
16 years 16 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
186
click to vote
MICRO
2006
IEEE
16 years 12 days ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
179
click to vote
STOC
2006
ACM
16 years 10 days ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
171
click to vote
ISCAS
2005
IEEE
15 years 12 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
173
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...