Sciweavers

2473 search results - page 66 / 495
» The Logic of Communication Graphs
Sort
View
GD
2001
Springer
14 years 6 days ago
A Characterization of DFS Cotree Critical Graphs
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
Hubert de Fraysseix, Patrice Ossona de Mendez
JGAA
2007
93views more  JGAA 2007»
13 years 7 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
JGAA
2002
81views more  JGAA 2002»
13 years 7 months ago
Graph Drawing in Motion
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
Carsten Friedrich, Peter Eades
JSYML
2002
170views more  JSYML 2002»
13 years 7 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia