Sciweavers

811 search results - page 15 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
DAM
2010
167views more  DAM 2010»
13 years 7 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
DATE
2002
IEEE
105views Hardware» more  DATE 2002»
14 years 17 days ago
Power-Manageable Scheduling Technique for Control Dominated High-Level Synthesis
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
Chunhong Chen, Majid Sarrafzadeh
COCOA
2009
Springer
13 years 11 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu
IWPEC
2009
Springer
14 years 2 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...