Sciweavers

6740 search results - page 27 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
FIW
2007
120views Communications» more  FIW 2007»
13 years 9 months ago
Problem-Oriented Feature Interaction Detection in Software Product Lines
Feature interaction detection in the context of systems that are highly integrated into their environment, such as embedded or software-intensive systems, is different from classi...
Andreas Classen
DAM
2011
13 years 2 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
13 years 8 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
CORR
2008
Springer
57views Education» more  CORR 2008»
13 years 7 months ago
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...