Sciweavers

251 search results - page 36 / 51
» The Graphs with All Subgraphs T-Perfect
Sort
View
JGT
2007
99views more  JGT 2007»
13 years 7 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...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Ego-centric Graph Pattern Census
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
Walaa Eldin Moustafa, Amol Deshpande, Lise Getoor
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
Graph-based iterative Group Analysis enhances microarray interpretation
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...
Rainer Breitling, Anna Amtmann, Pawel Herzyk
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova