搜索历史记录选项已关闭,请开启搜索历史记录选项。
作者: Eran Halperin
DOI: 10.1137/S0097539700381097
关键词:
摘要: … for graphs cannot be extended easily to hypergraphs, and thus our techniques establish a uniform approach for the vertex cover problem in graphs and in hypergraphs. … graphs. Given a …
Mathematical Foundations of Computer Science 2011,2011, 引用: 1
Algorithm Theory - SWAT 2004,2004, 引用: 10
,2009, 引用: 0
,2005, 引用: 55
international colloquium on automata languages and programming,2011, 引用: 6
,2012, 引用: 0
national conference on artificial intelligence,2012, 引用: 13
,2014, 引用: 1
Theory of Computing,2012, 引用: 36