523 search results - page 46 / 105 » Decidability of string graphs |
129
click to vote
IAT
2007
IEEE
15 years 10 months ago
2007
IEEE
Policy making is a multi-actor process: it involves a variety of actors, each trying to further their own interests. How these actors decide and act largely depends on the way the...
ESA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
125
Voted
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
114
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
134
click to vote
UAI
2003
15 years 5 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...