1736 search results - page 91 / 348 » On antimagic directed graphs |
CORR
2012
Springer
12 years 6 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
ECML
2006
Springer
14 years 2 months ago
2006
Springer
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
VMV
2001
14 years 4 days ago
2001
Computational steering requires the coupling of simulation and visualization elements, but if the latter is targetted at general requirements, little or no information about the c...
MFCS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...