Sciweavers

1736 search results - page 138 / 348
» On antimagic directed graphs
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
CISS
2007
IEEE
15 years 10 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ACISICIS
2005
IEEE
15 years 8 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
AAAI
2010
15 years 8 months ago
Fixing a Tournament
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
Virginia Vassilevska Williams
STRINGOLOGY
2008
15 years 8 months ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman