咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 4 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 23 篇 工学
    • 22 篇 计算机科学与技术...
    • 4 篇 软件工程
    • 1 篇 机械工程
    • 1 篇 生物工程
  • 17 篇 理学
    • 16 篇 数学
    • 1 篇 物理学
    • 1 篇 生物学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 2 篇 经济学
    • 2 篇 应用经济学

主题

  • 28 篇 exact exponentia...
  • 5 篇 chordal graphs
  • 4 篇 graph algorithms
  • 3 篇 np-hard problems
  • 3 篇 enumeration
  • 3 篇 subset feedback ...
  • 2 篇 enumeration algo...
  • 2 篇 chain subgraph c...
  • 2 篇 vertex cover
  • 2 篇 independent set
  • 2 篇 measure and conq...
  • 2 篇 parameterized al...
  • 1 篇 target set selec...
  • 1 篇 total tardiness
  • 1 篇 branch-width
  • 1 篇 graphs
  • 1 篇 minimal dominati...
  • 1 篇 isotropic decomp...
  • 1 篇 branch and bound
  • 1 篇 np-hard

机构

  • 5 篇 univ bergen dept...
  • 3 篇 univ lorraine li...
  • 3 篇 univ elect sci &...
  • 2 篇 univ paul verlai...
  • 2 篇 politecn torino ...
  • 2 篇 univ orleans ins...
  • 2 篇 univ bergen dept...
  • 1 篇 ras sobolev inst...
  • 1 篇 univ lyon 1 univ...
  • 1 篇 laboratoire d'in...
  • 1 篇 univ tokyo dept ...
  • 1 篇 univ warsaw inst...
  • 1 篇 univ lyon 1 univ...
  • 1 篇 charles univ pra...
  • 1 篇 sapienza univ ro...
  • 1 篇 nanyang technol ...
  • 1 篇 cnr ieiit i-1012...
  • 1 篇 universite franc...
  • 1 篇 univ chinese aca...
  • 1 篇 inria villeurban...

作者

  • 8 篇 kratsch dieter
  • 5 篇 fomin fedor v.
  • 4 篇 golovach petr a.
  • 3 篇 liedloff mathieu
  • 3 篇 xiao mingyu
  • 2 篇 heggernes pinar
  • 2 篇 della croce fede...
  • 2 篇 villanger yngve
  • 2 篇 bai tian
  • 2 篇 gastaldello matt...
  • 2 篇 sagot marie-fran...
  • 2 篇 sayadi mohamed y...
  • 2 篇 bliznets ivan
  • 2 篇 saurabh saket
  • 2 篇 mary arnaud
  • 2 篇 sinaimeri blerin...
  • 2 篇 calamoneri tizia...
  • 1 篇 couturier jean-f...
  • 1 篇 iwata yoichi
  • 1 篇 pilipczuk michal

语言

  • 26 篇 英文
  • 2 篇 其他
检索条件"主题词=Exact exponential algorithms"
28 条 记 录,以下是21-30 订阅
排序:
exact and Parameterized algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs  17th
Exact and Parameterized Algorithms for Restricted Subset Fee...
收藏 引用
17th Annual Conference on Theory and Applications of Models of Computation (TAMC)
作者: Bai, Tian Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China
The Restricted Subset Feedback Vertex Set problem (R-SFVS) takes a graph G = (V, E), a terminal set T subset of V, and an integer k as the input. The task is to determine whether there exists a subset S subset of V \ ... 详细信息
来源: 评论
On Maximal Chain Subgraphs and Covers of Bipartite Graphs  27th
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
收藏 引用
27th International Workshop on Combinatorial algorithms (IWOCA)
作者: Calamoneri, Tiziana Gastaldello, Mattia Mary, Arnaud Sagot, Marie-France Sinaimeri, Blerina Sapienza Univ Rome Via Salaria 113 I-00198 Rome Italy INRIA Villeurbanne France Univ Lyon 1 Univ Lyon LBBE CNRS UMR558 Villeurbanne France
In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm. We give bounds on the n... 详细信息
来源: 评论
exact algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice
Exact Algorithms With Worst-case Guarantee For Scheduling: F...
收藏 引用
作者: Lei Shang Universite Francois Rableais de Tours
学位级别:博士
This thesis summarizes the author's PhD research works on the design of exact al- gorithms that provide a worst-case (time or space) guarantee for N P-hard scheduling problems. Both theoretical and practical aspec... 详细信息
来源: 评论
Bicolored independent sets and bicliques
Bicolored independent sets and bicliques
收藏 引用
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011
作者: Couturier, Jean-François Kratsch, Dieter Laboratoire D'Informatique Th´eorique et Appliqúee Université Paul Verlaine 57045 Metz Cedex 01 France
来源: 评论
Quantum algorithms for One-Sided Crossing Minimization  32
Quantum Algorithms for One-Sided Crossing Minimization
收藏 引用
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024
作者: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe Roma Tre University Rome Italy
We present singly-exponential quantum algorithms for the One-Sided Crossing Minimization (OSCM) problem. We show that OSCM can be viewed as a set problem amenable for exact algorithms with a quantum speedup with respe... 详细信息
来源: 评论
FROM INDEPENDENT SETS AND VERTEX COLORINGS TO ISOTROPIC SPACES AND ISOTROPIC DECOMPOSITIONS: ANOTHER BRIDGE BETWEEN GRAPHS AND ALTERNATING MATRIX SPACES
收藏 引用
SIAM JOURNAL ON COMPUTING 2021年 第3期50卷 924-971页
作者: Bei, Xiaohui Chen, Shiteng Guan, Ji Qiao, Youming Sun, Xiaoming Nanyang Technol Univ Sch Phys & Math Sci Singapore 637371 Singapore Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Technol Sydney Ctr Quantum Software & Informat Parramatta NSW 2150 Australia Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
In the 1970s, Lovasz built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings [Proceedings of FCT, 1979, pp. 565-574]. A similar connection between bipartite graphs and matrix s... 详细信息
来源: 评论
exact algorithms for restricted subset feedback vertex set in chordal and split graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 984卷
作者: Bai, Tian Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China
The RESTRICTED SUBSET FEEDBACK VERTEX SET problem (R-SFVS) takes a graph G = (V, E), a terminal set T C V, an integer k as the input. The task is to determine whether there exists a subset S C V ⧵ T of at most k verti... 详细信息
来源: 评论
algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility
收藏 引用
algorithms FOR MOLECULAR BIOLOGY 2020年 第1期15卷 14-14页
作者: Calamoneri, Tiziana Gastaldello, Mattia Mary, Arnaud Sagot, Marie-France Sinaimeri, Blerina Inria Grenoble 655 Ave Europe F-38334 Montbonnot St Martin France Univ Lyon 1 Univ Lyon CNRS Lab Biometrie & Biol EvolutUMR 5558 43 Blvd 11 Novembre 1918 F-69622 Villeurbanne France Sapienza Univ Rome Dept Comp Sci Viale Regina Elena 295 I-00161 Rome Italy
Cytoplasmic incompatibility (CI) relates to the manipulation by the parasiteWolbachiaof its host reproduction. Despite its widespread occurrence, the molecular basis of CI remains unclear and theoretical models have b... 详细信息
来源: 评论