Sciweavers

1163 search results - page 195 / 233
» Embedding into Bipartite Graphs
Sort
View
JSYML
2007
66views more  JSYML 2007»
13 years 9 months ago
Spectra of structures and relations
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
Valentina S. Harizanov, Russel G. Miller
GD
2001
Springer
14 years 1 months ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...
IJCAI
1989
13 years 10 months ago
Generating Causal Explanation from a Cardio-Vascular Simulation
In this paper, we present QUALEX, a system and algorithm for generating first-order qualitative causal graphs for tutorial purposes based on de Kleer and Brown's qualitative ...
Sarah A. Douglas, Zheng-Yang Liu
ENTCS
2008
98views more  ENTCS 2008»
13 years 9 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 9 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik