6740 search results - page 435 / 1348 » An s -Hamiltonian Line Graph Problem |
166
click to vote
ISCAS
2005
IEEE
16 years 11 days ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
178
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
177
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
171
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
172
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...