Sciweavers

1883 search results - page 184 / 377
» Ordered theta graphs
Sort
View
GD
2006
Springer
13 years 11 months ago
Upright-Quad Drawing of st -Planar Learning Spaces
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
David Eppstein
SIROCCO
2007
13 years 9 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
COLING
1990
13 years 9 months ago
Solving Ambiguities In The Semantic Representation Of Texts
One of the issues of Artificial Intelligence is the transfer of the knowledge conveyed by Natural Language into formalisms that a computer can interpret. In the Natural Language P...
Marie-Claude Landau
DM
2008
76views more  DM 2008»
13 years 8 months ago
Graphic sequences with a realization containing a complete multipartite subgraph
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...
EJC
2008
13 years 8 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez