Sciweavers

3268 search results - page 112 / 654
» The hub number of a graph
Sort
View
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
15 years 11 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
PPL
2000
91views more  PPL 2000»
15 years 6 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
DM
2006
104views more  DM 2006»
15 years 6 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...
INFOCOM
1997
IEEE
15 years 10 months ago
Multiwavelength Optical Networks with Limited Wavelength Conversion
— This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can efficiently support lightpaths (connections) between nod...
Rajiv Ramaswami, Galen H. Sasaki
BMCBI
2006
144views more  BMCBI 2006»
15 years 6 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...