咨询与建议

限定检索结果

文献类型

  • 76 篇 期刊文献
  • 20 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 97 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 81 篇 工学
    • 78 篇 计算机科学与技术...
    • 18 篇 软件工程
    • 3 篇 电气工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 信息与通信工程
    • 1 篇 化学工程与技术
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 56 篇 理学
    • 53 篇 数学
    • 6 篇 生物学
    • 3 篇 统计学(可授理学、...
    • 1 篇 化学
  • 10 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 5 篇 经济学
    • 5 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 97 篇 parameterized al...
  • 11 篇 approximation al...
  • 7 篇 vertex cover
  • 6 篇 exact algorithm
  • 6 篇 kernelization
  • 5 篇 edge dominating ...
  • 5 篇 haplotype
  • 5 篇 dynamic programm...
  • 4 篇 clustering
  • 4 篇 randomized algor...
  • 4 篇 genotype
  • 3 篇 computational co...
  • 3 篇 pattern matching
  • 3 篇 tree decompositi...
  • 3 篇 independent set
  • 3 篇 fixed-parameter ...
  • 3 篇 enumeration
  • 3 篇 graph modificati...
  • 3 篇 representative f...
  • 3 篇 alignment networ...

机构

  • 8 篇 texas a&m univ d...
  • 8 篇 cent s univ sch ...
  • 7 篇 texas a&m univ d...
  • 4 篇 chalmers univ de...
  • 4 篇 technion israel ...
  • 4 篇 univ bergen berg...
  • 3 篇 jiangsu univ sci...
  • 3 篇 depaul univ sch ...
  • 3 篇 natl chung cheng...
  • 3 篇 hunan normal uni...
  • 3 篇 technion israel ...
  • 3 篇 cent south univ ...
  • 3 篇 univ elect sci &...
  • 3 篇 school of inform...
  • 2 篇 univ calif irvin...
  • 2 篇 shandong univ sc...
  • 2 篇 eindhoven univ t...
  • 2 篇 hunan univ techn...
  • 2 篇 cent south univ ...
  • 2 篇 univ utrecht dep...

作者

  • 16 篇 chen jianer
  • 15 篇 wang jianxin
  • 14 篇 zehavi meirav
  • 6 篇 feng qilong
  • 6 篇 shachnai hadas
  • 6 篇 song yinglei
  • 5 篇 damaschke peter
  • 5 篇 xie minzhu
  • 4 篇 saurabh saket
  • 4 篇 pinter ron y.
  • 3 篇 wu bang ye
  • 3 篇 chen li-hsuan
  • 3 篇 ono hirotaka
  • 3 篇 liu chunmei
  • 3 篇 xia ge
  • 3 篇 hanaka tesshu
  • 3 篇 xu chao
  • 3 篇 lokshtanov danie...
  • 3 篇 xiao mingyu
  • 2 篇 li wenjun

语言

  • 87 篇 英文
  • 9 篇 其他
  • 1 篇 中文
检索条件"主题词=Parameterized algorithm"
97 条 记 录,以下是51-60 订阅
排序:
On the complexity of the Cable-Trench Problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期340卷 272-285页
作者: Benedito, Marcelo P. L. Pedrosa, Lehilton L. C. Rosado, Hugo K. K. Univ Estadual Campinas Inst Comp Campinas Brazil
The Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given an edge-weighted graph with a special root vertex and par... 详细信息
来源: 评论
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第7期158卷 851-867页
作者: Ganian, Robert Hlineny, Petr Masaryk Univ Fac Informat Brno 60200 Czech Republic
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic al... 详细信息
来源: 评论
Fast Exact algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2011年 第5期8卷 1400-1410页
作者: Chen, Zhi-Zhong Wang, Lusheng Tokyo Denki Univ Dept Math Sci Hatomaya Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
We present two parameterized algorithms for the closest string problem. The first runs in O(nL + nd . 17.97(d)) time for DNA strings and in O(nL + nd . 61.86(d)) time for protein strings, where n is the number of inpu... 详细信息
来源: 评论
On the complexity of and solutions to the minimum stopping and trapping set problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 915卷 26-44页
作者: Velasquez, Alvaro Subramani, K. Wojciechowski, Piotr AF Res Lab Informat Directorate Rome NY 13441 USA West Virginia Univ LCSEE Morgantown WV 26506 USA
In this paper, we discuss the problems of finding minimum stopping sets and trapping sets in Tanner graphs, using integer linear programming. These problems are important for establishing reliable communication across... 详细信息
来源: 评论
On the Planarization of Wireless Sensor Networks
收藏 引用
algorithmICA 2011年 第3期60卷 593-608页
作者: Zhang, Fenghui Jiang, Anxiao (Andrew) Chen, Jianer Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA
Network planarization has been an important technique in numerous sensornet protocols-such as Greedy Perimeter Stateless Routing (GPSR), topology discovery, data-centric storage, etc.-however the planarization process... 详细信息
来源: 评论
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
收藏 引用
algorithmICA 2005年 第4期43卷 245-273页
作者: Chen, JN Kanj, IA Xia, G Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA DePaul Univ Sch CTI Chicago IL 60604 USA
A sequence of exact algorithms to solve the VERTEX COVER and MAXIMUM INDEPENDENT SET problems have been proposed in the literature. All these algorithms appeal to a very conservative analysis that considers the size o... 详细信息
来源: 评论
Dealing with 4-variables by resolution: An improved MaxSAT algorithm
收藏 引用
THEORETICAL COMPUTER SCIENCE 2017年 670卷 33-44页
作者: Chen, Jianer Xu, Chao Wang, Jianxin Cent South Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA
We study techniques for solving the MAXIMUM SATISFIABILITY problem (MAxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization ... 详细信息
来源: 评论
On Counting 3-D Matchings of Size k
收藏 引用
algorithmICA 2009年 第4期54卷 530-543页
作者: Liu, Yunlong Chen, Jianer Wang, Jianxin Cent S Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Hunan Normal Univ Sch Further Educ Changsha 410012 Peoples R China Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
The computational complexity of counting the number of matchings of size k in a given triple set has been open. It is conjectured that the problem is not fixed parameter tractable. In this paper, we present a fixed pa... 详细信息
来源: 评论
A multivariate framework for weighted FPT algorithms
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 89卷 157-189页
作者: Shachnai, Hadas Zehavi, Meirav Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel
We introduce a multivariate approach for solving weighted parameterized problems. By allowing flexible use of parameters, our approach defines a framework for applying the classic bounded search trees technique. In ou... 详细信息
来源: 评论
The label cut problem with respect to path length and label frequency
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 第0期648卷 72-83页
作者: Zhang, Peng Fu, Bin Shandong Univ Sch Comp Sci & Technol Jinan 250101 Peoples R China Univ Texas Pan Amer Dept Comp Sci Edinburg TX 78539 USA
Given a graph with labels defined on edges and a source-sink pair (s, t), the Label s-t Cut problem asks for a minimum number of labels such that the removal of edges with these labels disconnects s and t. Similarly, ... 详细信息
来源: 评论