Sciweavers

1736 search results - page 67 / 348
» The rank-width of Directed Graphs
Sort
View
138
Voted
AIRWEB
2007
Springer
15 years 10 months ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 4 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»
15 years 4 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
BIRTHDAY
2009
Springer
15 years 10 months ago
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
Michiel H. M. Smid
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 5 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