2503 search results - page 280 / 501 » A study of 3-arc graphs |
154
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
167
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
179
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
170
click to vote
SOFSEM
2010
Springer
16 years 29 days ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
176
Voted
ASWEC
2009
IEEE
16 years 29 days ago
2009
IEEE
We propose a novel methodology for analysing change propagation in software using the domain-level behavioural model of a system. We hypothesize that change propagation analysis i...