Sciweavers

1039 search results - page 145 / 208
» Kernels and Regularization on Graphs
Sort
View
NHM
2010
100views more  NHM 2010»
14 years 6 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
76
Voted
WG
2004
Springer
15 years 5 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
CORR
2008
Springer
100views Education» more  CORR 2008»
14 years 12 months ago
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
Lars Eirik Danielsen
INFORMATICALT
2006
104views more  INFORMATICALT 2006»
14 years 11 months ago
Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar Graphs
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
Auparajita Krishnaa, Manohar Singh Dulawat
MFCS
2007
Springer
15 years 6 months ago
Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Antoine Meyer