Sciweavers

5473 search results - page 795 / 1095
» On the graph isomorphism problem
Sort
View
RE
2005
Springer
16 years 3 days ago
An Algebraic Framework for Merging Incomplete and Inconsistent Views
View merging, also called view integration, is a key problem in conceptual modeling. Large models are often constructed and accessed by manipulating individual views, but it is im...
Mehrdad Sabetzadeh, Steve M. Easterbrook
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
16 years 3 days ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
MSWIM
2004
ACM
16 years 2 days ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
ICCS
2004
Springer
16 years 15 hour ago
Types and Tokens for Logic with Diagrams
It is well accepted that diagrams play a crucial role in human reasoning. But in mathematics, diagrams are most often only used for visualizations, but it is doubted that diagrams ...
Frithjof Dau
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
16 years 7 hour ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka