Sciweavers

9532 search results - page 107 / 1907
» Logic, Graphs, and Algorithms
Sort
View
STOC
2001
ACM
143views Algorithms» more  STOC 2001»
16 years 6 months ago
Computing crossing numbers in quadratic time
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
Martin Grohe
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 7 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler
AIML
2008
15 years 7 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
CIB
2005
125views more  CIB 2005»
15 years 6 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 10 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann