Sciweavers

4201 search results - page 42 / 841
» Interaction graphs: Additives
Sort
View
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
15 years 6 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
ICCS
2005
Springer
15 years 5 months ago
Hierarchical Knowledge Integration Using Layered Conceptual Graphs
Abstract We describe the ‘Hierarchical as View’ approach to knowledge integration from heterogeneous sources. This is based on a novel representation called Layered Conceptual ...
Madalina Croitoru, Ernesto Compatangelo, Chris Mel...
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 3 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
AGTIVE
2007
Springer
15 years 1 months ago
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...
Erhard Weinell
ECCC
2000
117views more  ECCC 2000»
14 years 11 months ago
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Oded Goldreich, Dana Ron