Sciweavers

1201 search results - page 13 / 241
» Linear Probing and Graphs
Sort
View
COCOON
2006
Springer
14 years 1 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
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 10 months ago
A System Theoretic Approach to Bandwidth Estimation
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...
FOCS
2009
IEEE
14 years 4 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
EJC
2008
13 years 10 months ago
A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...
Alice Devillers
ACTA
2006
74views more  ACTA 2006»
13 years 10 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer