Sciweavers

1736 search results - page 74 / 348
» The rank-width of Directed Graphs
Sort
View
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 9 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
CIE
2010
Springer
15 years 9 months ago
Spatial Models for Virtual Networks
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
Jeannette Janssen
SIAMDM
2008
190views more  SIAMDM 2008»
15 years 4 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
ALGORITHMICA
2002
116views more  ALGORITHMICA 2002»
15 years 4 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav...
TCSV
2008
175views more  TCSV 2008»
15 years 4 months ago
Expandable Data-Driven Graphical Modeling of Human Actions Based on Salient Postures
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
Wanqing Li, Zhengyou Zhang, Zicheng Liu