6740 search results - page 176 / 1348 » An s -Hamiltonian Line Graph Problem |
SODA
2012
ACM
12 years 25 days ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
ORL
2008
13 years 10 months ago
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
ISQED
2009
IEEE
14 years 5 months ago
2009
IEEE
We present a small-area 10T SRAM cell without half selection problem. As well, the proposed 10T cell achieves a faster access time and low voltage operation. The cell area is redu...
VAMOS
2009
Springer
14 years 5 months ago
2009
Springer
Software Product Lines (SPL) and Runtime Adaptation (RTA) have traditionally been distinct research areas addressing different problems and with different communities. Despite the...