All separating triangles in a plane graph can be optimally broken in polynomial time

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	ACCORNERO, A, ANCONA, M, VARINI, S
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Information retrieval. Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	290
container_issue
container_start_page	278
container_title
container_volume
creator	ACCORNERO, A ANCONA, M VARINI, S
description
doi_str_mv	10.1007/3-540-46784-x_27
format	Conference Proceeding
fullrecord	<record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_1170394</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1170394</sourcerecordid><originalsourceid>FETCH-LOGICAL-p99t-c614738b00f9eed0cf73d29f6a363d738f48f0430e10043d2f2f709c064ffcb63</originalsourceid><addsrcrecordid>eNotj71PwzAUxC0-JErpzuiB1fCcZ-x4rCq-pEos2asX1y4B17HiDPS_xwhuueF3Ot0xdivhXgKYBxSPCoTSplXie9eYM7aQWkqBqOw5u8ZKtTYo2wu2AIRGWKPwiq1K-YQqbFBLvWDdOkZefKaJ5iEd-DwNlA7RFz4kTjxHSp4fJsof3FHivedjnocjxXji_TR--fQbzGM8pfE4UOQV-ht2GSgWv_r3Jeuen7rNq9i-v7xt1luRrZ2F01IZbHuAYL3fgwsG940NmlDjvpKg2gAKwdfDqqLQBAPWgVYhuF7jkt391WYqjmKYKLmh7PJU902nnZQG0Cr8AWFrVcA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>All separating triangles in a plane graph can be optimally broken in polynomial time</title><source>Springer Books</source><creator>ACCORNERO, A ; ANCONA, M ; VARINI, S</creator><creatorcontrib>ACCORNERO, A ; ANCONA, M ; VARINI, S</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540667318</identifier><identifier>ISBN: 9783540667315</identifier><identifier>EISSN: 1611-3349</identifier><identifier>DOI: 10.1007/3-540-46784-x_27</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information retrieval. Graph ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 1999, p.278-290</ispartof><rights>2000 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,780,784,789,790,4050,4051,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1170394$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ACCORNERO, A</creatorcontrib><creatorcontrib>ANCONA, M</creatorcontrib><creatorcontrib>VARINI, S</creatorcontrib><title>All separating triangles in a plane graph can be optimally broken in polynomial time</title><title>Lecture notes in computer science</title><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540667318</isbn><isbn>9783540667315</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotj71PwzAUxC0-JErpzuiB1fCcZ-x4rCq-pEos2asX1y4B17HiDPS_xwhuueF3Ot0xdivhXgKYBxSPCoTSplXie9eYM7aQWkqBqOw5u8ZKtTYo2wu2AIRGWKPwiq1K-YQqbFBLvWDdOkZefKaJ5iEd-DwNlA7RFz4kTjxHSp4fJsof3FHivedjnocjxXji_TR--fQbzGM8pfE4UOQV-ht2GSgWv_r3Jeuen7rNq9i-v7xt1luRrZ2F01IZbHuAYL3fgwsG940NmlDjvpKg2gAKwdfDqqLQBAPWgVYhuF7jkt391WYqjmKYKLmh7PJU902nnZQG0Cr8AWFrVcA</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>ACCORNERO, A</creator><creator>ANCONA, M</creator><creator>VARINI, S</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>1999</creationdate><title>All separating triangles in a plane graph can be optimally broken in polynomial time</title><author>ACCORNERO, A ; ANCONA, M ; VARINI, S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p99t-c614738b00f9eed0cf73d29f6a363d738f48f0430e10043d2f2f709c064ffcb63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ACCORNERO, A</creatorcontrib><creatorcontrib>ANCONA, M</creatorcontrib><creatorcontrib>VARINI, S</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ACCORNERO, A</au><au>ANCONA, M</au><au>VARINI, S</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>All separating triangles in a plane graph can be optimally broken in polynomial time</atitle><btitle>Lecture notes in computer science</btitle><date>1999</date><risdate>1999</risdate><spage>278</spage><epage>290</epage><pages>278-290</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540667318</isbn><isbn>9783540667315</isbn><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/3-540-46784-x_27</doi><tpages>13</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Lecture notes in computer science, 1999, p.278-290
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_1170394
source	Springer Books
subjects	Applied sciences Computer science control theory systems Exact sciences and technology Information retrieval. Graph Theoretical computing
title	All separating triangles in a plane graph can be optimally broken in polynomial time
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T15%3A27%3A39IST&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=All%20separating%20triangles%20in%20a%20plane%20graph%20can%20be%20optimally%20broken%20in%20polynomial%20time&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=ACCORNERO,%20A&rft.date=1999&rft.spage=278&rft.epage=290&rft.pages=278-290&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540667318&rft.isbn_list=9783540667315&rft_id=info:doi/10.1007/3-540-46784-x_27&rft_dat=%3Cpascalfrancis%3E1170394%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