1105 search results - page 83 / 221 » Linear choosability of graphs |
127
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
117
click to vote
BPM
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
131
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
165
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
151
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...