Sciweavers

1545 search results - page 184 / 309
» On tree congestion of graphs
Sort
View
LICS
2005
IEEE
15 years 3 months ago
Ludics Nets, a game Model of Concurrent Interaction
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
Claudia Faggian, François Maurel
70
Voted
GD
2003
Springer
15 years 3 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
DDEP
2000
Springer
15 years 2 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
15 years 2 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
ACL
2008
14 years 11 months ago
Efficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
Michaela Regneri, Markus Egg, Alexander Koller