Sciweavers

35 search results - page 1 / 7
» Backbone colorings for graphs: Tree and path backbones
Sort
View
JGT
2007
99views more  JGT 2007»
13 years 4 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
PCI
2005
Springer
13 years 10 months ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
IJCAI
2001
13 years 6 months ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
DAM
2010
99views more  DAM 2010»
13 years 5 months ago
Backbone colorings of graphs with bounded degree
Jozef Miskuf, Riste Skrekovski, Martin Tancer
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 5 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer