Sciweavers

253 search results - page 36 / 51
» Testing subgraphs in directed graphs
Sort
View
CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 9 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
ICMCS
2005
IEEE
148views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
Christos Theoharatos, Vassilios K. Pothos, George ...
LAWEB
2003
IEEE
14 years 3 months ago
Storing RDF as a Graph
RDF is the first W3C standard for enriching information resources of the Web with detailed meta data. The semantics of RDF data is defined using a RDF schema. The most expressiv...
Valerie Bönström, Annika Hinze, Heinz Sc...
ICST
2009
IEEE
14 years 4 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...