Sciweavers

1736 search results - page 96 / 348
» On antimagic directed graphs
Sort
View
TCS
2002
13 years 10 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 10 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 11 months ago
Digraph Decompositions and Monotonicity in Digraph Searching
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
Stephan Kreutzer, Sebastian Ordyniak
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 10 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
14 years 6 days 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