Parallel computation on interval graphs: algorithms and experiments-Reference-Cited by-同舟云学术

Parallel computation on interval graphs: algorithms and experiments

Published:2002-08-14 Issue:11 Volume:14 Page:885-910
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat.: Pract. Exper.

Author:

Ferreira A.,Guérin Lassous I.,Marcus K.,Rau-Chaplin A.

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Reference37 articles.

1. The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time;Cole;Algorithmica,1988

2. Moitra A Johnson R PT-Optimal algorithms for interval graphs Proceedings of the 26th Annual Allerton Conference Communication, Control and Computing 1998 274 282

3. Kim SK Optimal parallel algorithms on sorted intervals Proceedings of the 27th Annual Allerton Conference Communication, Control and Computing 1990 766 775

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs;Theoretical Computer Science;2020-01

2. Multi-exposure imaging for measurements in rubber production;Measurement Science and Technology;2013-06-12

3. Minimal-Bracketing Sets for High-Dynamic-Range Image Capture;IEEE Transactions on Image Processing;2008-10

4. The interval-merging problem;Information Sciences;2007-01

5. Minimal Capture Sets for Multi-Exposure Enhanced-Dynamic-Range Imaging;2006 IEEE International Symposium on Signal Processing and Information Technology;2006-08