Sciweavers

491 search results - page 29 / 99
» On cyclically orientable graphs
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 10 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
ASUNAM
2010
IEEE
13 years 10 months ago
Pixel-Oriented Visualization of Change in Social Networks
We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cl...
Klaus Stein, Rene Wegener, Christoph Schlieder
FMOODS
2006
13 years 9 months ago
Defining Object-Oriented Execution Semantics Using Graph Transformations
In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics ...
Harmen Kastenberg, Anneke Kleppe, Arend Rensink
WG
2004
Springer
14 years 1 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 8 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard