咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Bicolored independent sets and bicliques
收藏 引用
INFORMATION PROCESSING LETTERS 2012年 第8-9期112卷 329-334页
作者: Couturier, Jean-Francois Kratsch, Dieter Univ Paul Verlaine Metz Lab Informat Theor & Appl F-57045 Metz 01 France
We introduce the decision problem BICOLORED INDEPENDENT SET which generalizes the well-known NP-complete graph problem INDEPENDENT SET. We present an O(1.2691(n)) time algorithm solving its counting analogue #BICOLORE... 详细信息
来源: 评论
COUNTING SUBGRAPHS VIA HOMOMORPHISMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2012年 第2期26卷 695-717页
作者: Amini, Omid Fomin, Fedor V. Saurabh, Saket Ecole Normale Super CNRS DMA Paris France Univ Bergen Dept Informat N-5008 Bergen Norway Inst Math Sci TCS Madras 600113 Tamil Nadu India
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algorithms and unifies several well-known re... 详细信息
来源: 评论
Computing hypergraph width measures exactly
收藏 引用
INFORMATION PROCESSING LETTERS 2012年 第6期112卷 238-242页
作者: Moll, Lukas Tazari, Siamak Thurley, Marc MIT Cambridge MA 02139 USA Univ Berlin Berlin Germany Ctr Rec Matemat Bellaterra Spain
Hypergraph width measures are important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. As a consequence, ... 详细信息
来源: 评论
Branch and Recharge: exact algorithms for Generalized Domination
收藏 引用
ALGORITHMICA 2011年 第2期61卷 252-273页
作者: Fomin, Fedor V. Golovach, Petr A. Kratochvl, Jan Kratsch, Dieter Liedloff, Mathieu Univ Paul Verlaine Metz Lab Informat Theor & Appl F-57045 Metz 01 France Univ Bergen Dept Informat N-5020 Bergen Norway Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England Charles Univ Prague Dept Appl Math CR-11800 Prague 1 Czech Republic Charles Univ Prague Inst Theoret Comp Sci CR-11800 Prague 1 Czech Republic Univ Orleans Lab Informat Fondamentale Orleans F-45067 Orleans 2 France
In this paper we present branching algorithms for infinite classes of problems. The novelty in the design and analysis of our branching algorithms lies in the fact that the weights are redistributed over the graph by ... 详细信息
来源: 评论
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
来源: 评论
Computing rank-width exactly
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第13期109卷 745-748页
作者: Oum, Sang-il Korea Adv Inst Sci & Technol Dept Math Sci Taejon 305701 South Korea
We prove that the rank-width of an n-vertex graph can be computed exactly in time O(2(n)n(3) log(2) n log log n). To improve over a trivial O(3(n) log n)-time algorithm, we develop a general framework for decompositio... 详细信息
来源: 评论
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
收藏 引用
JOURNAL OF DISCRETE algorithms 2009年 第2期7卷 191-212页
作者: Razgon, Igor Univ Coll Cork Dept Comp Sci Cork Ireland
In this paper we propose an O(1.0892(n))algorithm solving the Maximum Independent Set problem for graphs with maximum degree 3 improving the previously best upper bound of O(1.0977(n)). A useful secondary effect of th... 详细信息
来源: 评论
Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications
收藏 引用
ACM TRANSACTIONS ON algorithms 2008年 第1期5卷 1–17页
作者: Fomin, Fedor V. Grandoni, Fabrizio Pyatkin, Artem V. Stepanov, Alexey A. Univ Bergen Dept Informat N-5020 Bergen Norway Univ Roma Tor Vergata Dipartimento Informat Sistemi & Produz I-00133 Rome Italy RAS Sobolev Inst Math Siberian Branch Novosibirsk Russia
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.7159(n)). This result can be seen as an algorithmic proof of the fact that the number of minimal dominating sets in a gr... 详细信息
来源: 评论