13306 search results - page 451 / 2662 » Theoretical Computer Science |
199
click to vote
WG
2004
Springer
16 years 28 days ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
218
click to vote
WG
2004
Springer
16 years 28 days ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
161
click to vote
WG
2004
Springer
16 years 28 days ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
159
click to vote
GI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract: Sowohl im praktischen Diskurs von Bürgerrechtsvertretern und Datenschützern wie auch in theoretisch ausgerichteten Debatten werden Ausdrücke wie Ubiquitous Computing, ...
177
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
— Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome [9], [15] for such a game is an equilibrium concept that combine...