Sciweavers

6740 search results - page 101 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ORL
1998
136views more  ORL 1998»
13 years 9 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 10 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
DIAGRAMS
2008
Springer
13 years 12 months ago
Supporting Reasoning and Problem-Solving in Mathematical Generalisation with Dependency Graphs
Abstract. We present a brief description of the design of a diagrambased system that supports the development of thinking about mathematical generalisation. Within the software, th...
Sergio Gutiérrez Santos, Darren Pearce, Eir...
JCT
2010
158views more  JCT 2010»
13 years 8 months ago
An asymptotic solution to the cycle decomposition problem for complete graphs
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
Darryn E. Bryant, Daniel Horsley
JMLR
2006
124views more  JMLR 2006»
13 years 10 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini