Parallel computation on interval graphs: algorithms and experiments
This paper describes efficient coarse‐grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth‐first‐search and depth‐first‐s...
Saved in:
| Published in | Concurrency and computation Vol. 14; no. 11; pp. 885 - 910 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Chichester, UK
John Wiley & Sons, Ltd
25.08.2002
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1532-0626 1532-0634 |
| DOI | 10.1002/cpe.700 |
Cover
| Abstract | This paper describes efficient coarse‐grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth‐first‐search and depth‐first‐search trees, as well as $O(log p)$ communication rounds algorithms for optimization problems such as minimum interval covering, maximum independent set and minimum dominating set, where $p$ is the number of processors in the parallel system. This implies that the number of communication rounds is independent of the problem size. Implementations of these algorithms are evaluated on parallel clusters, using both Fast Ethernet and Myrinet interconnection networks, and on a CRAY T3E parallel multicomputer, with extensive experimental results being presented and analyzed. Copyright © 2002 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | This paper describes efficient coarse‐grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth‐first‐search and depth‐first‐search trees, as well as
$O(log p)$
communication rounds algorithms for optimization problems such as minimum interval covering, maximum independent set and minimum dominating set, where
$p$
is the number of processors in the parallel system. This implies that the number of communication rounds is independent of the problem size. Implementations of these algorithms are evaluated on parallel clusters, using both Fast Ethernet and Myrinet interconnection networks, and on a CRAY T3E parallel multicomputer, with extensive experimental results being presented and analyzed. Copyright © 2002 John Wiley & Sons, Ltd. This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth-first-search and depth-first-search trees, as well as O (log p) communication rounds algorithms for optimization problems such as minimum interval covering, maximum independent set and minimum dominating set, where p is the number of processors in the parallel system. This implies that the number of communication rounds is independent of the problem size. Implementations of these algorithms are evaluated on parallel clusters, using both Fast Ethernet and Myrinet interconnection networks, and on a CRAY T3E parallel multicomputer, with extensive experimental results being presented and analyzed. Copyright copyright 2002 John Wiley & Sons, Ltd. This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth-first- search and depth-first- search trees, as well as communication rounds algorithms for optimization problems such as minimum interval covering, maximum independent set and minimum dominating set, where is the number of processors in the parallel system. This implies that the number of communication rounds is independent of the problem size. Implementations of these algorithms are evaluated on parallel clusters, using both Fast Ethernet and Myrinet interconnection networks, and on a CRAY T3E parallel multicomputer, with extensive experimental results being presented and analyzed. This paper describes efficient coarse‐grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth‐first‐search and depth‐first‐search trees, as well as $O(log p)$ communication rounds algorithms for optimization problems such as minimum interval covering, maximum independent set and minimum dominating set, where $p$ is the number of processors in the parallel system. This implies that the number of communication rounds is independent of the problem size. Implementations of these algorithms are evaluated on parallel clusters, using both Fast Ethernet and Myrinet interconnection networks, and on a CRAY T3E parallel multicomputer, with extensive experimental results being presented and analyzed. Copyright © 2002 John Wiley & Sons, Ltd. |
| Author | Guérin Lassous, I. Marcus, K. Ferreira, A. Rau-Chaplin, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Ferreira fullname: Ferreira, A. email: ferreira@sophia.inria.fr organization: CNRS, Projet Mascotte, BP 93, F-06902 Sophia Antipolis, France – sequence: 2 givenname: I. surname: Guérin Lassous fullname: Guérin Lassous, I. organization: INRIA - LIP, ENS Lyon, 46, allée d'Italie, F-69364 Lyon Cedex 07, France – sequence: 3 givenname: K. surname: Marcus fullname: Marcus, K. organization: Eurecom, 2229, route des Cretes, BP 193, 06901 Sophia Antipolis Cedex, France – sequence: 4 givenname: A. surname: Rau-Chaplin fullname: Rau-Chaplin, A. organization: Faculty of Computer Science, Dalhousie University, P.O. Box 1000, Halifax NS, Canada B3J 2X4 |
| BookMark | eNqN0E1LwzAYwPEgCm5T_Ao96UE689Zm9SZjneLQKYrHkKbpFk1fTDrdvr2Rjh1EQUh4cvgRkn8f7Fd1pQA4QXCIIMQXslFDBuEe6KGI4BDGhO7vzjg-BH3nXiFECBLUA-O5sMIYZQJZl82qFa2uq8AvXbXKfggTLKxolu4yEGZRW90uSxeIKg_UulFWl6pq3RE4KIRx6ng7B-A5nTyNr8PZ_fRmfDULJYkSGFKGYDFiOBaC5iOaEIIRYyiPEprHMPEbZlgKnGVCsSInkWKkyGjhp2QRKcgAnHb3NrZ-XynX8lI7qYwRlapXjmMW-88S9B9IKWXEw7CD0tbOWVVwqbsErRXacAT5d1Pum3Lf1PuzH77xDYTd_CLPO_mpjdr8xfh4Pun09h3atWq908K-8ZgRFvGXuyl_SOEjvk2nPCVfFd-VeQ |
| CitedBy_id | crossref_primary_10_1088_0957_0233_24_7_074014 crossref_primary_10_1016_j_tcs_2019_10_042 crossref_primary_10_1016_j_ins_2006_03_009 crossref_primary_10_1109_TIP_2008_2001414 |
| Cites_doi | 10.1007/3-540-40064-8_18 10.1007/3-540-45718-6_64 10.1006/jpdc.1994.1085 10.1007/3-540-40064-8_9 10.7551/mitpress/5712.001.0001 10.1109/71.139209 10.1145/79173.79181 10.1109/TC.1979.1675260 10.1287/opre.31.1.24 10.1142/S0129626499000384 10.1007/BF01762121 10.1109/SPDP.1995.530733 10.1007/BFb0057943 10.1016/0166-218X(87)90068-0 |
| ContentType | Journal Article |
| Copyright | Copyright © 2002 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 2002 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION 7SP 8FD L7M 7SC JQ2 L~C L~D |
| DOI | 10.1002/cpe.700 |
| DatabaseName | Istex CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Computer and Information Systems Abstracts Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Technology Research Database Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1532-0634 |
| EndPage | 910 |
| ExternalDocumentID | 10_1002_cpe_700 CPE700 ark_67375_WNG_QF0R2KFG_F |
| Genre | article |
| GroupedDBID | .3N .DC .GA .Y3 05W 0R~ 10A 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEIGN AEIMD AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGQPQ AGYGG AHBTC AITYG AIURR AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BSCLL BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS EJD F00 F01 F04 F5P FEDTE G-S G.N GNP GODZA HGLYW HHY HVGLF HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAHHS ACCFJ ADZOD AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE RWI WRC AAYXX CITATION 7SP 8FD L7M 7SC JQ2 L~C L~D |
| ID | FETCH-LOGICAL-c3590-4710f8726aa4d8493321771d594d609d600b2ca2bbae7fd35e73fb4f5e7c753f3 |
| IEDL.DBID | DR2 |
| ISSN | 1532-0626 |
| IngestDate | Mon Sep 29 06:14:26 EDT 2025 Thu Oct 02 13:44:54 EDT 2025 Thu Apr 24 22:57:19 EDT 2025 Wed Oct 01 00:58:44 EDT 2025 Wed Jan 22 16:38:43 EST 2025 Sun Sep 21 06:18:32 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3590-4710f8726aa4d8493321771d594d609d600b2ca2bbae7fd35e73fb4f5e7c753f3 |
| Notes | istex:AF82758EDA86FB3996893BB4CAA2DF2D3CDFD4E0 ArticleID:CPE700 ark:/67375/WNG-QF0R2KFG-F ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 27644473 |
| PQPubID | 23500 |
| PageCount | 26 |
| ParticipantIDs | proquest_miscellaneous_27663431 proquest_miscellaneous_27644473 crossref_citationtrail_10_1002_cpe_700 crossref_primary_10_1002_cpe_700 wiley_primary_10_1002_cpe_700_CPE700 istex_primary_ark_67375_WNG_QF0R2KFG_F |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 25 August 2002 |
| PublicationDateYYYYMMDD | 2002-08-25 |
| PublicationDate_xml | – month: 08 year: 2002 text: 25 August 2002 day: 25 |
| PublicationDecade | 2000 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Concurrency and computation |
| PublicationTitleAlternate | Concurrency Computat.: Pract. Exper |
| PublicationYear | 2002 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | Geist A, Beguelin A, Dongarra J, Jiang W, Manchek R, Sunderman V. PVM: Parallel Virtual Machine-A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press: Cambridge, 1994. Ferreira A, Schabanel N. A randomized BSP/CGM algorithm for the maximal independent set. Parallel Processing Letters 2000; 9(3):411-422. Golumbic MC. Algorithmic Graph Theory and Perfect Graphs. Academic: New York, 1980. Olariu S, Schwing JL, Zhang J. Optimal parallel algorithms for problems modelled by a family of intervals. IEEE Transactions on Parallel and Distributed Systems 1992; 3(3):364-374. Dekel E, Sahni S. Parallel scheduling algorithms. Operations Research 1983; 31(1):24-39. Bertossi AA, Bonuccelli MA. Some parallel algorithms on interval graphs. Discrete Applied Mathematics 1987; 16:101-111. Gupta UI, Lee DT, Leung JY-T. An optimal solution for the channel-assignment problem. IEEE Transactions on Computers 1979; C-28:807-810. Valiant LG. A bridging model for parallel computation. Communications of the ACM 1990; 33:103-111. Cole R, Vishkin U. The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time. Algorithmica 1988; 3:329-346. Cormen T, Leiserson CE, Rivest R. Introduction to Algorithms. MIT Press: Cambridge, MA, 1990. Gerbessiotis AV, Valiant LG. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing 1994; 22:251-267. 1988; 3 1990; 33 1990 2001 2000 2000; 9 1998 1983; 31 1997 1994; 22 1996 1995 1979; C‐28 1994 1993 1992 1980 1992; 3 1987; 16 1988 Dehne F (e_1_2_1_18_2) 1995 Cormen T (e_1_2_1_31_2) 1990 Olariu S (e_1_2_1_2_2) 1996 Geist A (e_1_2_1_38_2) 1994 Li H (e_1_2_1_27_2) 1994 Dehne F (e_1_2_1_14_2) 1993 Hambrusch S (e_1_2_1_15_2) 1994 e_1_2_1_22_2 Golumbic MC (e_1_2_1_34_2) 1980 e_1_2_1_23_2 e_1_2_1_24_2 Deng X (e_1_2_1_21_2) 1994 e_1_2_1_29_2 Carrano AV (e_1_2_1_10_2) 1988 Caceres E (e_1_2_1_28_2) 1997 Karf RM (e_1_2_1_12_2) 1993 e_1_2_1_6_2 e_1_2_1_30_2 e_1_2_1_7_2 Dehne F (e_1_2_1_20_2) 1994 e_1_2_1_4_2 Culler DE (e_1_2_1_13_2) 1993 e_1_2_1_11_2 e_1_2_1_3_2 e_1_2_1_33_2 e_1_2_1_32_2 Das SK (e_1_2_1_5_2) 1992 e_1_2_1_16_2 Guérin Lassous I (e_1_2_1_26_2) 2000 e_1_2_1_37_2 e_1_2_1_36_2 e_1_2_1_35_2 e_1_2_1_19_2 Goodrich MT (e_1_2_1_25_2) 1996 e_1_2_1_8_2 e_1_2_1_17_2 e_1_2_1_9_2 |
| References_xml | – reference: Dekel E, Sahni S. Parallel scheduling algorithms. Operations Research 1983; 31(1):24-39. – reference: Cole R, Vishkin U. The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time. Algorithmica 1988; 3:329-346. – reference: Bertossi AA, Bonuccelli MA. Some parallel algorithms on interval graphs. Discrete Applied Mathematics 1987; 16:101-111. – reference: Ferreira A, Schabanel N. A randomized BSP/CGM algorithm for the maximal independent set. Parallel Processing Letters 2000; 9(3):411-422. – reference: Valiant LG. A bridging model for parallel computation. Communications of the ACM 1990; 33:103-111. – reference: Gupta UI, Lee DT, Leung JY-T. An optimal solution for the channel-assignment problem. IEEE Transactions on Computers 1979; C-28:807-810. – reference: Cormen T, Leiserson CE, Rivest R. Introduction to Algorithms. MIT Press: Cambridge, MA, 1990. – reference: Geist A, Beguelin A, Dongarra J, Jiang W, Manchek R, Sunderman V. PVM: Parallel Virtual Machine-A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press: Cambridge, 1994. – reference: Olariu S, Schwing JL, Zhang J. Optimal parallel algorithms for problems modelled by a family of intervals. IEEE Transactions on Parallel and Distributed Systems 1992; 3(3):364-374. – reference: Gerbessiotis AV, Valiant LG. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing 1994; 22:251-267. – reference: Golumbic MC. Algorithmic Graph Theory and Perfect Graphs. Academic: New York, 1980. – start-page: 131 year: 1992 end-page: 143 – volume: 33 start-page: 103 year: 1990 end-page: 111 article-title: A bridging model for parallel computation publication-title: Communications of the ACM – volume: 3 start-page: 364 issue: 3 year: 1992 end-page: 374 article-title: Optimal parallel algorithms for problems modelled by a family of intervals publication-title: IEEE Transactions on Parallel and Distributed Systems – start-page: 561 year: 1995 end-page: 569 – start-page: 46 year: 1994 end-page: 56 – start-page: 274 year: 1998 end-page: 282 – volume: 3 start-page: 329 year: 1988 end-page: 346 article-title: The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time publication-title: Algorithmica – volume: 22 start-page: 251 year: 1994 end-page: 267 article-title: Direct bulk‐synchronous parallel algorithms publication-title: Journal of Parallel and Distributed Computing – start-page: 1 year: 1993 end-page: 12 – year: 1996 – year: 2000 – start-page: 766 year: 1990 end-page: 775 – start-page: 355 year: 1996 end-page: 403 – year: 1990 – start-page: 298 year: 1993 end-page: 307 – year: 1994 – start-page: 586 year: 1994 end-page: 593 – volume: 16 start-page: 101 year: 1987 end-page: 111 article-title: Some parallel algorithms on interval graphs publication-title: Discrete Applied Mathematics – start-page: 131 year: 1997 end-page: 143 – start-page: 184 year: 2000 end-page: 195 – start-page: 27 year: 1995 end-page: 33 – start-page: 83 year: 2000 end-page: 94 – volume: 31 start-page: 24 issue: 1 year: 1983 end-page: 39 article-title: Parallel scheduling algorithms publication-title: Operations Research – start-page: 538 year: 1994 end-page: 543 – year: 1980 – year: 1988 – year: 1997 – start-page: 111 year: 2000 end-page: 123 – volume: 9 start-page: 411 issue: 3 year: 2000 end-page: 422 article-title: A randomized BSP/CGM algorithm for the maximal independent set publication-title: Parallel Processing Letters – volume: C‐28 start-page: 807 year: 1979 end-page: 810 article-title: An optimal solution for the channel‐assignment problem publication-title: IEEE Transactions on Computers – start-page: 875 year: 1998 end-page: 886 – start-page: 589 year: 2001 end-page: 598 – start-page: 278 year: 1993 end-page: 285 – ident: e_1_2_1_11_2 – start-page: 538 volume-title: Proceedings 6th IEEE Symposium on Parallel and Distributed Processing year: 1994 ident: e_1_2_1_21_2 – ident: e_1_2_1_24_2 doi: 10.1007/3-540-40064-8_18 – start-page: 278 volume-title: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing year: 1993 ident: e_1_2_1_12_2 – start-page: 355 volume-title: Handbook of Parallel and Distributed Computing year: 1996 ident: e_1_2_1_2_2 – volume-title: Introduction to Algorithms year: 1990 ident: e_1_2_1_31_2 – start-page: 111 volume-title: Proceedings of the Workshop on Algorithm Engineering (WAE 2000) year: 2000 ident: e_1_2_1_26_2 – start-page: 298 volume-title: Proceedings of the 9th ACM Symposium on Computational Geometry year: 1993 ident: e_1_2_1_14_2 – start-page: 586 volume-title: Proceedings 6th IEEE SPDP year: 1994 ident: e_1_2_1_20_2 – start-page: 46 volume-title: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures year: 1994 ident: e_1_2_1_27_2 – volume-title: Biotechnology and the Human Genome year: 1988 ident: e_1_2_1_10_2 – ident: e_1_2_1_19_2 doi: 10.1007/3-540-45718-6_64 – ident: e_1_2_1_32_2 doi: 10.1006/jpdc.1994.1085 – ident: e_1_2_1_6_2 – ident: e_1_2_1_36_2 – ident: e_1_2_1_17_2 doi: 10.1007/3-540-40064-8_9 – volume-title: PVM: Parallel Virtual Machine—A Users' Guide and Tutorial for Networked Parallel Computing year: 1994 ident: e_1_2_1_38_2 doi: 10.7551/mitpress/5712.001.0001 – start-page: 27 volume-title: Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architectures year: 1995 ident: e_1_2_1_18_2 – ident: e_1_2_1_35_2 – ident: e_1_2_1_7_2 doi: 10.1109/71.139209 – start-page: 131 volume-title: Proceedings of ICALP'97 year: 1997 ident: e_1_2_1_28_2 – ident: e_1_2_1_16_2 doi: 10.1145/79173.79181 – start-page: 1 volume-title: Proceedings of the 4th ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming year: 1993 ident: e_1_2_1_13_2 – volume-title: Algorithmic Graph Theory and Perfect Graphs year: 1980 ident: e_1_2_1_34_2 – ident: e_1_2_1_9_2 doi: 10.1109/TC.1979.1675260 – ident: e_1_2_1_33_2 doi: 10.1287/opre.31.1.24 – start-page: 131 volume-title: Proceedings of the 4th International PARLE Conference year: 1992 ident: e_1_2_1_5_2 – ident: e_1_2_1_23_2 doi: 10.1142/S0129626499000384 – ident: e_1_2_1_37_2 – ident: e_1_2_1_3_2 doi: 10.1007/BF01762121 – ident: e_1_2_1_29_2 – volume-title: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing year: 1994 ident: e_1_2_1_15_2 – ident: e_1_2_1_22_2 doi: 10.1109/SPDP.1995.530733 – volume-title: Proceedings of the 28th Symposium on Theory of Computing year: 1996 ident: e_1_2_1_25_2 – ident: e_1_2_1_30_2 doi: 10.1007/BFb0057943 – ident: e_1_2_1_8_2 doi: 10.1016/0166-218X(87)90068-0 – ident: e_1_2_1_4_2 |
| SSID | ssj0011031 |
| Score | 1.6214987 |
| Snippet | This paper describes efficient coarse‐grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring... This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 885 |
| SubjectTerms | coarse grain interval graphs parallel algorithms practical experiments |
| Title | Parallel computation on interval graphs: algorithms and experiments |
| URI | https://api.istex.fr/ark:/67375/WNG-QF0R2KFG-F/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.700 https://www.proquest.com/docview/27644473 https://www.proquest.com/docview/27663431 |
| Volume | 14 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1532-0634 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: ADMLS dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVWIB databaseName: Wiley Online Library - Core collection (SURFmarket) issn: 1532-0626 databaseCode: DR2 dateStart: 19960101 customDbUrl: isFulltext: true eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 providerName: Wiley-Blackwell |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS-QwFA6iL77oemPHXTUP4lvHtEmb1jcZrKIoKsrKvoRcd8WxI9MZWPz1nqSd8caKCC15yElJc3KS7-TyHYS2Y8qMUc6va1ASsYSpSGaURoZy62A4tMb5Hd3Ts-zomh3fpDcvQn01_BDTBTdvGWG89gYuVb37TBqqH2yXE--txzQLztTllDgq9sELGqbUJCKA2Zvrsr7kblvu1Tw055v03yuQ-RKqhrmmXES_J7Vsjpjcdccj1dWPbwgcv_Qb39BCi0DxftNlltCMrZbR4iS6A26NfQX1zuXQB1rpYx3yggoxPLfhmCR8IpBd13tY9v8Mhrejv_c1lpXBz0ED6lV0XR5c9Y6iNuRCpGlagLIAcLicJ5mUzOSsoBRcFh6btGAmIwW8RCVaJkpJy52hqeXUKeYg1eD4OLqGZqtBZb8jbElu_RURyQvAZCbNdW4N0S7XJpMFjztoZ6IAoVs-ch8Woy8aJuVEQNMIaJoOwlPBh4aC473ITtDgNF8O7_yJNZ6KX2eH4qIkl8lJeSjKDtqaqFiAHfnNEVnZwbgWCQdkyDj9UCKjgLc6aDso9H-VEb3zA0jWPyf2A82HADMEBqz0J5odDcd2A3DOSG2GLv0EulT6rQ |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB4h9gAX6APE9oUPiFsWb-zESW_VasO2wAoQqEgcLMcPQGyzaB9S1V_fsZNdSlGrqlIiHzyOHI_H_saPbwD2uowbUzq_rsFoxGNeRiplLDJMWIfDoTXO7-ieDNPBJf9ylVw1pyr9XZiaH2K54OYtI4zX3sD9gvTBI2uofrAdQdFdb_EUvRQPiM6X1FFdH76g5kqNI4qovb4w64seNAWfzEQt36jfn8DMX8FqmG2KTbhe1LM-ZHLfmc_Kjv7xG4Xj__3IC9hoQCj5VPeal7Biq1ewuQjwQBp7fw29UzXxsVZGRIe8oEWCz104KYmfCHzX049EjW7Gk7vZ7bcpUZUhj3EDpltwWfQveoOoiboQaZbkqC_EHC4TcaoUNxnPGUOvRXRNknOT0hxfWsZaxWWprHCGJVYwV3KHqUbfx7FtWK3Gld0BYmlm_S0RJXKEZSbJdGYN1S7TJlW56LZhf6EBqRtKch8ZYyRrMuVYYtNIbJo2kKXgQ83C8VxkP6hwma8m9_7Qmkjk1-GhPCvoeXxUHMqiDbsLHUs0Jb8_oio7nk9lLBAccsH-KpEyhFxt2Asa_VNlZO-0j8mbfxPbhbXBxcmxPP48PHoL6yHeDMXxK3kHq7PJ3L5H2DMrP4T-_RNoVP7O |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB5VIFW9lEdbdQsFHxC3LN7YiRNuaCG82tUWFRWpB8vxgyKW7GofEuLXd-xkl9KqFaqUyAePI8fjsT_b428AdjqMG1M6v6_BaMRjXkYqZSwyTFiHw6E1zp_ofu6lJ5f87Cq5arwq_V2Ymh9iseHmLSOM197A7ci4vUfWUD2ybUFxub7Mkzzz7nyHFwvqqI4PX1BzpcYRRdReX5j1Rfeagk9momXfqPdPYOavYDXMNsUKfJ_Xs3YyuW3PpmVbP_xG4fh_P7IKrxsQSg7qXrMGL2y1DivzAA-ksfc30O2rsY-1MiA65AUtEnxugqckfiLwXU_2iRpcD8c30x93E6IqQx7jBkzewmVx9LV7EjVRFyLNkhz1hZjDZSJOleIm4zljuGoRHZPk3KQ0x5eWsVZxWSornGGJFcyV3GGqce3j2DtYqoaVfQ_E0sz6WyJK5AjLTJLpzBqqXaZNqnLRacHuXANSN5TkPjLGQNZkyrHEppHYNC0gC8FRzcLxp8huUOEiX41vvdOaSOS33rH8UtCL-Lw4lkULtuc6lmhK_nxEVXY4m8hYIDjkgv1TImUIuVqwEzT6t8rIbv8Ikw_PE9uGl_3DQn467Z1vwKsQbobi8JVswtJ0PLMfEfVMy63QvX8CErT-Ug |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+computation+on+interval+graphs%3A+Algorithms+and+experiments&rft.jtitle=Concurrency+and+computation&rft.au=Ferreira%2C+A&rft.au=Guerin+Lassous%2C+I&rft.au=Marcus%2C+K&rft.au=Rau-Chaplin%2C+A&rft.date=2002-08-25&rft.issn=1532-0626&rft.volume=14&rft.issue=11&rft.spage=885&rft.epage=910&rft_id=info:doi/10.1002%2Fcpe.700&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon |