Sciweavers

504 search results - page 3 / 101
» Canonical Graph Shapes
Sort
View
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
CSR
2008
Springer
13 years 10 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky
IPL
2010
160views more  IPL 2010»
13 years 7 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
PG
1998
IEEE
14 years 24 days ago
Shape Space from Deformation
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geom...
Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu
EJC
2006
13 years 8 months ago
On the canonical metric representation, average distance, and partial Hamming graphs
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
Sandi Klavzar