Sciweavers

2283 search results - page 10 / 457
» Bounds of Graph Characteristics
Sort
View
ESANN
2006
13 years 9 months ago
Using Regression Error Characteristic Curves for Model Selection in Ensembles of Neural Networks
Regression Error Characteristic (REC) analysis is a technique for evaluation and comparison of regression models that facilitates the visualization of the performance of many regre...
Aloísio Carlos de Pina, Gerson Zaverucha
WG
2005
Springer
14 years 1 months ago
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
Omer Giménez, Petr Hlinený, Marc Noy
ECCC
2000
117views more  ECCC 2000»
13 years 7 months ago
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Oded Goldreich, Dana Ron
STACS
2009
Springer
14 years 2 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
ISAAC
2005
Springer
93views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Representation of Graphs by OBDDs
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
Robin Nunkesser, Philipp Woelfel