Sciweavers

263 search results - page 23 / 53
» Path partitions of hypercubes
Sort
View
WG
2007
Springer
14 years 2 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
OSDI
2006
ACM
14 years 8 months ago
Distributed Directory Service in the Farsite File System
We present the design, implementation, and evaluation of a fully distributed directory service for Farsite, a logically centralized file system that is physically implemented on a...
John R. Douceur, Jon Howell
EJC
2011
13 years 3 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades
WG
2007
Springer
14 years 2 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder
IEEEPACT
2000
IEEE
14 years 25 days ago
Instruction Scheduling for Clustered VLIW DSPs
Recent digital signal processors (DSPs) show a homogeneous VLIW-like data path architecture, which allows C compilers to generate efficient code. However, still some special rest...
Rainer Leupers