6598 search results - page 30 / 1320 » Graph Theory with Applications |
148
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
102
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
113
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
144
click to vote
MSCS
2007
15 years 3 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
109
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...