6740 search results - page 480 / 1348 » An s -Hamiltonian Line Graph Problem |
142
click to vote
JAIR
2011
15 years 1 months ago
2011
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
175
click to vote
GLOBECOM
2008
IEEE
2008
IEEE
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
15 years 7 months ago
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
177
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
187
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
185
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...