Sciweavers

458 search results - page 18 / 92
» Totally magic graphs
Sort
View
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 10 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
DASFAA
2007
IEEE
172views Database» more  DASFAA 2007»
14 years 3 months ago
Optimizing Multiple In-Network Aggregate Queries in Wireless Sensor Networks
Abstract. In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial ...
Huei-You Yang, Wen-Chih Peng, Chia-Hao Lo
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
14 years 19 days ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
JBI
2004
163views Bioinformatics» more  JBI 2004»
13 years 10 months ago
Artificial Chemistries and Metabolic Pathways
Metabolism can be regarded as a network of biochemical reactions, connected via their substrates and products. A metabolic pathway is thus a coordinated series of reactions, and i...
Liliana Félix, Francesc Rosselló, Ga...
DM
2006
104views more  DM 2006»
13 years 8 months ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...