Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	FELLOWS, Michael R, MCCARTIN, Catherine, ROSAMOND, Frances A, STEGE, Ulrike
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	251
container_issue
container_start_page	240
container_title
container_volume
creator	FELLOWS, Michael R MCCARTIN, Catherine ROSAMOND, Frances A STEGE, Ulrike
description
format	Conference Proceeding
fullrecord	<record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_782357</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>782357</sourcerecordid><originalsourceid>FETCH-LOGICAL-p183t-9bad969dbf964cd7957daeb42763afb4b383243412b833b4659d3a5115d9e20b3</originalsourceid><addsrcrecordid>eNotjM1KAzEURoM_YKl9h4DrgUluZjJxV4pVoaCLui43k0wbzSRDEqX16S3q2Xyb850LMmMtYxWAUJdkoWQHjagFEwzYFZnVUPNKSQE3ZJHze30GOADwGTmuYkzGBSzu2xr6YVOwPlMMhvZY0J-K62my5rMvLoZM7-kyUDdOKX6d9fXrlqLfx-TKYaRDTHTEI_UWB5onDMGFPS3J2t9eLAeb6PmpvR3zLbke0Ge7-N85eVs_bFdP1ebl8Xm13FQT66BUSqNRrTJ6UK3ojVSNNGi14LIFHLTQ0AEXIBjXHYAWbaMMYMNYY5TltYY5ufvrTph79EPC0Lu8m5IbMZ12suPQSPgBcf1enA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems</title><source>Springer Books</source><creator>FELLOWS, Michael R ; MCCARTIN, Catherine ; ROSAMOND, Frances A ; STEGE, Ulrike</creator><creatorcontrib>FELLOWS, Michael R ; MCCARTIN, Catherine ; ROSAMOND, Frances A ; STEGE, Ulrike</creatorcontrib><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540414131</identifier><identifier>ISBN: 3540414134</identifier><identifier>EISSN: 1611-3349</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2000, p.240-251</ispartof><rights>2001 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</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=782357$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>FELLOWS, Michael R</creatorcontrib><creatorcontrib>MCCARTIN, Catherine</creatorcontrib><creatorcontrib>ROSAMOND, Frances A</creatorcontrib><creatorcontrib>STEGE, Ulrike</creatorcontrib><title>Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems</title><title>Lecture notes in computer science</title><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540414131</isbn><isbn>3540414134</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotjM1KAzEURoM_YKl9h4DrgUluZjJxV4pVoaCLui43k0wbzSRDEqX16S3q2Xyb850LMmMtYxWAUJdkoWQHjagFEwzYFZnVUPNKSQE3ZJHze30GOADwGTmuYkzGBSzu2xr6YVOwPlMMhvZY0J-K62my5rMvLoZM7-kyUDdOKX6d9fXrlqLfx-TKYaRDTHTEI_UWB5onDMGFPS3J2t9eLAeb6PmpvR3zLbke0Ge7-N85eVs_bFdP1ebl8Xm13FQT66BUSqNRrTJ6UK3ojVSNNGi14LIFHLTQ0AEXIBjXHYAWbaMMYMNYY5TltYY5ufvrTph79EPC0Lu8m5IbMZ12suPQSPgBcf1enA</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>FELLOWS, Michael R</creator><creator>MCCARTIN, Catherine</creator><creator>ROSAMOND, Frances A</creator><creator>STEGE, Ulrike</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems</title><author>FELLOWS, Michael R ; MCCARTIN, Catherine ; ROSAMOND, Frances A ; STEGE, Ulrike</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p183t-9bad969dbf964cd7957daeb42763afb4b383243412b833b4659d3a5115d9e20b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FELLOWS, Michael R</creatorcontrib><creatorcontrib>MCCARTIN, Catherine</creatorcontrib><creatorcontrib>ROSAMOND, Frances A</creatorcontrib><creatorcontrib>STEGE, Ulrike</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>FELLOWS, Michael R</au><au>MCCARTIN, Catherine</au><au>ROSAMOND, Frances A</au><au>STEGE, Ulrike</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems</atitle><btitle>Lecture notes in computer science</btitle><date>2000</date><risdate>2000</risdate><spage>240</spage><epage>251</epage><pages>240-251</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540414131</isbn><isbn>3540414134</isbn><cop>Berlin</cop><pub>Springer</pub><tpages>12</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Lecture notes in computer science, 2000, p.240-251
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_782357
source	Springer Books
subjects	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Theoretical computing
title	Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T20%3A44%3A49IST&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=Coordinatized%20kernels%20and%20catalytic%20reductions%20:%20An%20improved%20FPT%20algorithm%20for%20max%20leaf%20spanning%20tree%20and%20other%20problems&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=FELLOWS,%20Michael%20R&rft.date=2000&rft.spage=240&rft.epage=251&rft.pages=240-251&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540414131&rft.isbn_list=3540414134&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E782357%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