Sciweavers

1368 search results - page 224 / 274
» Generalized Rook Polynomials
Sort
View
TALG
2010
110views more  TALG 2010»
15 years 4 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
WINET
2010
146views more  WINET 2010»
15 years 4 months ago
Allocating data for broadcasting over wireless channels subject to transmission errors
Broadcasting is an efficient and scalable way of transmitting data over wireless channels to an unlimited number of clients. In this paper the problem of allocating data to multip...
Paolo Barsocchi, Alan A. Bertossi, Maria Cristina ...
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
15 years 3 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
OPODIS
2010
15 years 3 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
GD
2009
Springer
15 years 3 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...