Search Sciweavers | Sciweavers

4110 search results - page 4 / 822

» Efficient algorithms for the 2-gathering problem

click to vote

SIAMCOMP
1998

168views more SIAMCOMP 1998»

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

13 years 10 months ago

Download reference.kfupm.edu.sa

This paper ﬁrst presents a uniﬁed approach to design eﬃcient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...

Maw-Shang Chang

claim paper

Read More »

click to vote

SODA
1994
ACM

73views Algorithms» more SODA 1994»

An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem

14 years 5 days ago

Download www.cs.utexas.edu

Vijaya Ramachandran, Honghua Yang

claim paper

Read More »

click to vote

ESOP
2009
Springer

142views Programming Languages» more ESOP 2009»

An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees

14 years 2 months ago

Download www.cs.cityu.edu.hk

The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...

Hao Yuan, Patrick Th. Eugster

claim paper

Read More »

click to vote

SODA
2001
ACM

97views Algorithms» more SODA 2001»

An efficient algorithm for the configuration problem of dominance graphs

14 years 6 days ago