发布求助
文献互助 智能选刊 最新文献

Journal of computer and system sciences (Print)最新文献

筛选
英文 中文
Searching for better fill-in 寻找更好的填充
Journal of computer and system sciences (Print) Pub Date : 2014-11-01 DOI: 10.4230/LIPIcs.STACS.2013.8
F. Fomin, Yngve Villanger
{"title":"Searching for better fill-in","authors":"F. Fomin, Yngve Villanger","doi":"10.4230/LIPIcs.STACS.2013.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.STACS.2013.8","url":null,"abstract":"Abstract Minimum Fill-in is a fundamental and classical problem arising in sparse matrix computations. In terms of graphs it can be formulated as a problem of finding a triangulation of a given graph with the minimum number of edges. In this paper, we study the parameterized complexity of local search for the Minimum Fill-in problem in the following form: Given a triangulation H of a graph G, is there a better triangulation, i.e. triangulation with less edges than H, within a given distance from H? We prove that this problem is fixed-parameter tractable (FPT) being parameterized by the distance from the initial triangulation, by providing an algorithm that in time f ( k ) | G | O ( 1 ) decides if a better triangulation of G can be obtained by swapping at most k edges of H. Our result adds Minimum Fill-in to the list of very few problems for which local search is known to be FPT.","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128707327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Preprocessing subgraph and minor problems: When does a small vertex cover help? 预处理子图和小问题:小顶点覆盖什么时候有用?
Journal of computer and system sciences (Print) Pub Date : 2012-06-21 DOI: 10.1007/978-3-642-33293-7_11
F. Fomin, B. Jansen, Michal Pilipczuk
{"title":"Preprocessing subgraph and minor problems: When does a small vertex cover help?","authors":"F. Fomin, B. Jansen, Michal Pilipczuk","doi":"10.1007/978-3-642-33293-7_11","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_11","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115435454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 63
Drawing a tree as a minimum spanning tree approximation 画一个树作为最小生成树的近似
Journal of computer and system sciences (Print) Pub Date : 2010-12-15 DOI: 10.1007/978-3-642-17514-5_6
E. D. Giacomo, W. Didimo, G. Liotta, H. Meijer
{"title":"Drawing a tree as a minimum spanning tree approximation","authors":"E. D. Giacomo, W. Didimo, G. Liotta, H. Meijer","doi":"10.1007/978-3-642-17514-5_6","DOIUrl":"https://doi.org/10.1007/978-3-642-17514-5_6","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122072862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
The parameterized complexity of some minimum label problems 一类最小标签问题的参数化复杂度
Journal of computer and system sciences (Print) Pub Date : 2009-12-04 DOI: 10.1007/978-3-642-11409-0_8
M. Fellows, Jiong Guo, Iyad A. Kanj
{"title":"The parameterized complexity of some minimum label problems","authors":"M. Fellows, Jiong Guo, Iyad A. Kanj","doi":"10.1007/978-3-642-11409-0_8","DOIUrl":"https://doi.org/10.1007/978-3-642-11409-0_8","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126849695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
A linear vertex kernel for maximum internal spanning tree 一个最大内部生成树的线性顶点核
Journal of computer and system sciences (Print) Pub Date : 2009-07-20 DOI: 10.1007/978-3-642-10631-6_29
F. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
{"title":"A linear vertex kernel for maximum internal spanning tree","authors":"F. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé","doi":"10.1007/978-3-642-10631-6_29","DOIUrl":"https://doi.org/10.1007/978-3-642-10631-6_29","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134270052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 83
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem k顶点出分支树算法及其在k内部出分支问题中的应用
Journal of computer and system sciences (Print) Pub Date : 2009-03-05 DOI: 10.1007/978-3-642-02882-3_5
Nathann Cohen, F. Fomin, G. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
{"title":"Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem","authors":"Nathann Cohen, F. Fomin, G. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo","doi":"10.1007/978-3-642-02882-3_5","DOIUrl":"https://doi.org/10.1007/978-3-642-02882-3_5","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126935932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 46
A bridging model for multi-core computing 多核计算的桥接模型
Journal of computer and system sciences (Print) Pub Date : 2008-09-15 DOI: 10.1007/978-3-540-87744-8_2
L. Valiant
{"title":"A bridging model for multi-core computing","authors":"L. Valiant","doi":"10.1007/978-3-540-87744-8_2","DOIUrl":"https://doi.org/10.1007/978-3-540-87744-8_2","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131289032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 217
The complexity of Boolean formula minimization 布尔公式最小化的复杂性
Journal of computer and system sciences (Print) Pub Date : 2008-07-07 DOI: 10.1007/978-3-540-70575-8_3
David Buchfuhrer, C. Umans
{"title":"The complexity of Boolean formula minimization","authors":"David Buchfuhrer, C. Umans","doi":"10.1007/978-3-540-70575-8_3","DOIUrl":"https://doi.org/10.1007/978-3-540-70575-8_3","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116357784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 81
Spanners in sparse graphs 稀疏图中的扳手
Journal of computer and system sciences (Print) Pub Date : 2008-07-07 DOI: 10.1007/978-3-540-70575-8_49
F. Dragan, F. Fomin, P. Golovach
{"title":"Spanners in sparse graphs","authors":"F. Dragan, F. Fomin, P. Golovach","doi":"10.1007/978-3-540-70575-8_49","DOIUrl":"https://doi.org/10.1007/978-3-540-70575-8_49","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123266493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Improved algorithms for feedback vertex set problems 改进的反馈顶点集问题算法
Journal of computer and system sciences (Print) Pub Date : 2007-08-15 DOI: 10.1007/978-3-540-73951-7_37
Jianer Chen, F. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
{"title":"Improved algorithms for feedback vertex set problems","authors":"Jianer Chen, F. Fomin, Yang Liu, Songjian Lu, Yngve Villanger","doi":"10.1007/978-3-540-73951-7_37","DOIUrl":"https://doi.org/10.1007/978-3-540-73951-7_37","url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129157964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 158
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信