1162 search results - page 24 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
164
click to vote
FLAIRS
2010
15 years 6 months ago
2010
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
111
click to vote
ACTAC
2007
15 years 3 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
143
click to vote
ICCAD
2003
IEEE
16 years 19 days ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
186
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
149
Voted
WG
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...