Sciweavers

12459 search results - page 209 / 2492
» cans 2006
Sort
View
DAM
2006
66views more  DAM 2006»
15 years 4 months ago
On the structure of the adjacency matrix of the line digraph of a regular digraph
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
Simone Severini
DCG
2006
96views more  DCG 2006»
15 years 4 months ago
Elementary Moves on Triangulations
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
Monika Ludwig, Matthias Reitzner
DM
2006
108views more  DM 2006»
15 years 4 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
EC
2006
118views ECommerce» more  EC 2006»
15 years 4 months ago
Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming
We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then ...
Paul Massey, John A. Clark, Susan Stepney
EJC
2006
15 years 4 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