咨询与建议

限定检索结果

文献类型

  • 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 订阅
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, ... 详细信息
来源: 评论
Representative families: A unified tradeoff-based approach
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2016年 第3期82卷 488-502页
作者: Shachnai, Hadas Zehavi, Meirav Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel
Given a matroid M = (E, I), and a family S of p-subsets of E, a subfamily (S) over cap subset of S represents S if for any X is an element of S and Y subset of E \ X satisfying X boolean OR Y is an element of I, there... 详细信息
来源: 评论
Orthogonal graph drawing with inflexible edges
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2016年 55卷 26-40页
作者: Blaesius, Thomas Lehmann, Sebastian Rutter, Ignaz KIT Karlsruhe Germany Hasso Plattner Inst Potsdam Germany
We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge. More precisely, we have a flexibility function a... 详细信息
来源: 评论
Improved parameterized and exact algorithms for cut problems on trees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第Part3期607卷 455-470页
作者: Kanj, Iyad Lin, Guohui Liu, Tian Tong, Weitian Xia, Ge Xu, Jinhui Yang, Boting Zhang, Fenghui Zhang, Peng Zhu, Binhai Depaul Univ Sch Comp Chicago IL 60604 USA Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Peking Univ Sch Elect Engn & Comp Sci Key Lab High Confidence Software Technol Minist EducInst Software Beijing 100871 Peoples R China Lafayette Coll Dept Comp Sci Easton PA 18042 USA SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA Univ Regina Dept Comp Sci Regina SK S4S 0A2 Canada Google Kirkland Kirkland WA 98033 USA Shandong Univ Sch Comp Sci & Technol Jinan Peoples R China Montana State Univ Dept Comp Sci Bozeman MT 59717 USA
We study the MULTICUT ON TREES and the GENERALIZED MULTIWAY CUT ON TREES problems. For the MULTICUT ON TREES problem, we present a parameterized algorithm that runs in time O*(rho(k)), where rho = root root 2 + 1 <... 详细信息
来源: 评论
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第Part2期560卷 158-171页
作者: Feng, Qilong Wang, Jianxin Xu, Chao Yao, Jinyi Chen, Jianer Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
The parameterized Minimum Link-Length Rectilinear Spanning Path problem in the d-dimensional Euclidean space R-d (d-RSP), for a given set S of n points in R-d and a positive integer k, is to find a rectilinear spannin... 详细信息
来源: 评论
A parameterized algorithm for the hyperplane-cover problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第44-46期411卷 4005-4009页
作者: Wang, Jianxin Li, Wenjun Chen, Jianer Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA Cent S Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China
We consider the problem of covering a given set of points in the Euclidean space R-m by a small number k of hyperplanes of dimensions bounded by d, where d <= m. We present a very simple parameterized algorithm for... 详细信息
来源: 评论
Combinatorics for smaller kernels: The differential of a graph
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期562卷 330-345页
作者: Bermudo, Sergio Fernau, Henning Pablo de Olavide Univ Dept Econ Quantitat Methods & Econ Hist Seville 41013 Spain Univ Trier Fachbereich 4 Abt Informat Wissensch D-54286 Trier Germany
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V\D that have a neighbor in the vertex set D. The differential of D is defined as partial derivative(D) = vertical bar B(D)vertical bar - ver... 详细信息
来源: 评论
Finding and enumerating large intersections
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 580卷 75-82页
作者: Damaschke, Peter Chalmers Univ Dept Comp Sci & Engn S-41296 Gothenburg Sweden
We study the calculation of the largest pairwise intersections in a given set family. We give combinatorial and algorithmic results both for the worst case and for set families where the frequencies of elements follow... 详细信息
来源: 评论
On the independent set problem in random graphs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2015年 第11期92卷 2233-2242页
作者: Song, Yinglei Jiangsu Univ Sci & Technol Sch Comp Sci & Engn Zhanjiang 212003 Jiangsu Peoples R China
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph G, each pair of vertices are joined by an edge with a probability p, whe... 详细信息
来源: 评论
Randomized algorithms for parameterized Kidney Exchange Problem
Randomized Algorithms for Parameterized Kidney Exchange Prob...
收藏 引用
2015全国理论计算机科学学术年会
作者: Mugang Lin Jianxin Wang Qilong Feng School of Information Science and Engineering Central South UniversityChangsha 410083China Departm School of Information Science and Engineering Central South UniversityChangsha 410083China
Kidney exchange programs have been established in several countries to organize kidney exchanges between incompatible patient-donor *** core of these programs are algorithms to solve kidney exchange problem, which can... 详细信息
来源: 评论