Sciweavers

163 search results - page 10 / 33
» The Weighted Integrity Problem is Polynomial for Interval Gr...
Sort
View
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
13 years 7 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...
IJFCS
2007
93views more  IJFCS 2007»
13 years 7 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 9 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
ISCI
1998
91views more  ISCI 1998»
13 years 7 months ago
The Improper Fuzzy Riemann Integral and its Numerical Integration
The improper fuzzy Riemann integral and its numerical integration are proposed in this paper. Under the setting of the improper fuzzy Riemann integral, we can ®nd the expectation...
Hsien-Chung Wu