Efficient parallel solution to calculate all cycles in graphs
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 420 |
---|---|
container_issue | |
container_start_page | 411 |
container_title | |
container_volume | |
creator | CERRUELA GARCIA, G LOPEZ ESPINOSA, E LUQUE RUIZ, I GOMEZ-NIETO, M. A |
description | |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_14477748</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>14477748</sourcerecordid><originalsourceid>FETCH-LOGICAL-p100t-a2fc62eb6e7139d54629ebc9c87ad32c48f6bf927f88ddf927cf3d8f6a16389e3</originalsourceid><addsrcrecordid>eNotjstqwzAURAVtoSH1P2jTpUHWVfRYdFFC-oBANu06XF9JiYpqG0tZ5O_r0s5mhjMwzA1rnLGwUUKBsVrdspUAIVtnFNyzppQvsQg6LY1dsaddjIlSGCqfcMacQ-ZlzJeaxoHXkRNmumSsgS8dpyvlUHga-GnG6Vwe2F3EXELz72v2-bL72L61-8Pr-_Z5306dELVFGUnL0OtgOnB-o7R0oSdH1qAHScpG3UcnTbTW-99AEfwCsdNgXYA1e_zbnbAsj-KMA6VynOb0jfP12ClljFEWfgA6qkh1</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Efficient parallel solution to calculate all cycles in graphs</title><source>Springer Books</source><creator>CERRUELA GARCIA, G ; LOPEZ ESPINOSA, E ; LUQUE RUIZ, I ; GOMEZ-NIETO, M. A</creator><creatorcontrib>CERRUELA GARCIA, G ; LOPEZ ESPINOSA, E ; LUQUE RUIZ, I ; GOMEZ-NIETO, M. A</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540437864</identifier><identifier>ISBN: 354043786X</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Operational research and scientific management ; Operational research. Management science ; Queuing theory. Traffic theory</subject><ispartof>Lecture notes in computer science, 2002, p.411-420</ispartof><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,776,780,785,786,4035,4036</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14477748$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>CERRUELA GARCIA, G</creatorcontrib><creatorcontrib>LOPEZ ESPINOSA, E</creatorcontrib><creatorcontrib>LUQUE RUIZ, I</creatorcontrib><creatorcontrib>GOMEZ-NIETO, M. A</creatorcontrib><title>Efficient parallel solution to calculate all cycles in graphs</title><title>Lecture notes in computer science</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Queuing theory. Traffic theory</subject><issn>0302-9743</issn><isbn>9783540437864</isbn><isbn>354043786X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2002</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotjstqwzAURAVtoSH1P2jTpUHWVfRYdFFC-oBANu06XF9JiYpqG0tZ5O_r0s5mhjMwzA1rnLGwUUKBsVrdspUAIVtnFNyzppQvsQg6LY1dsaddjIlSGCqfcMacQ-ZlzJeaxoHXkRNmumSsgS8dpyvlUHga-GnG6Vwe2F3EXELz72v2-bL72L61-8Pr-_Z5306dELVFGUnL0OtgOnB-o7R0oSdH1qAHScpG3UcnTbTW-99AEfwCsdNgXYA1e_zbnbAsj-KMA6VynOb0jfP12ClljFEWfgA6qkh1</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>CERRUELA GARCIA, G</creator><creator>LOPEZ ESPINOSA, E</creator><creator>LUQUE RUIZ, I</creator><creator>GOMEZ-NIETO, M. A</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>Efficient parallel solution to calculate all cycles in graphs</title><author>CERRUELA GARCIA, G ; LOPEZ ESPINOSA, E ; LUQUE RUIZ, I ; GOMEZ-NIETO, M. A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p100t-a2fc62eb6e7139d54629ebc9c87ad32c48f6bf927f88ddf927cf3d8f6a16389e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Queuing theory. Traffic theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CERRUELA GARCIA, G</creatorcontrib><creatorcontrib>LOPEZ ESPINOSA, E</creatorcontrib><creatorcontrib>LUQUE RUIZ, I</creatorcontrib><creatorcontrib>GOMEZ-NIETO, M. A</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>CERRUELA GARCIA, G</au><au>LOPEZ ESPINOSA, E</au><au>LUQUE RUIZ, I</au><au>GOMEZ-NIETO, M. A</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Efficient parallel solution to calculate all cycles in graphs</atitle><btitle>Lecture notes in computer science</btitle><date>2002</date><risdate>2002</risdate><spage>411</spage><epage>420</epage><pages>411-420</pages><issn>0302-9743</issn><isbn>9783540437864</isbn><isbn>354043786X</isbn><cop>Berlin</cop><pub>Springer</pub><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2002, p.411-420 |
issn | 0302-9743 |
language | eng |
recordid | cdi_pascalfrancis_primary_14477748 |
source | Springer Books |
subjects | Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Queuing theory. Traffic theory |
title | Efficient parallel solution to calculate all cycles in graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T10%3A37%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Efficient%20parallel%20solution%20to%20calculate%20all%20cycles%20in%20graphs&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=CERRUELA%20GARCIA,%20G&rft.date=2002&rft.spage=411&rft.epage=420&rft.pages=411-420&rft.issn=0302-9743&rft.isbn=9783540437864&rft.isbn_list=354043786X&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E14477748%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |