Sciweavers

1736 search results - page 42 / 348
» The rank-width of Directed Graphs
Sort
View
GD
1995
Springer
15 years 1 months ago
Incremental Layout in DynaDAG
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
Stephen C. North
JGAA
2007
123views more  JGAA 2007»
14 years 10 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
DCG
2000
84views more  DCG 2000»
14 years 10 months ago
Convex and Linear Orientations of Polytopal Graphs
This paper examines directed graphs related to convex polytopes. For each fixed d-polytope and any acyclic orientation of its graph, we prove there exist both convex and concave fu...
J. Mihalisin, Victor Klee
CN
1999
56views more  CN 1999»
14 years 10 months ago
Surfing the Web Backwards
From a user's perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering "backlinks&qu...
Soumen Chakrabarti, David Gibson, Kevin S. McCurle...
IPMU
2010
Springer
14 years 8 months ago
Possibilistic Graphical Models and Compositional Models
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
Jirina Vejnarová