Sciweavers

134 search results - page 20 / 27
» Induced Subgraphs of Bounded Degree and Bounded Treewidth
Sort
View
JCT
2010
112views more  JCT 2010»
13 years 5 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 1 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
COCOON
2006
Springer
13 years 11 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
PODS
2004
ACM
139views Database» more  PODS 2004»
14 years 7 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
ENDM
2007
88views more  ENDM 2007»
13 years 7 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...