咨询与建议

限定检索结果

文献类型

  • 311 篇 期刊文献
  • 68 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 235 篇 理学
    • 232 篇 数学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 2 篇 物理学
  • 232 篇 工学
    • 191 篇 计算机科学与技术...
    • 38 篇 软件工程
    • 33 篇 电气工程
    • 17 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 2 篇 动力工程及工程热...
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 96 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 17 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 21 篇 经济学
    • 17 篇 应用经济学
    • 5 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 381 篇 polynomial-time ...
  • 36 篇 computational co...
  • 23 篇 np-completeness
  • 17 篇 np-hardness
  • 16 篇 np-hard
  • 16 篇 scheduling
  • 12 篇 np-complete
  • 11 篇 dynamic programm...
  • 10 篇 linear programmi...
  • 10 篇 graph theory
  • 9 篇 np-hard problem
  • 9 篇 independent set
  • 9 篇 combinatorial op...
  • 8 篇 approximation al...
  • 8 篇 stable matching
  • 7 篇 discrete tomogra...
  • 7 篇 matching
  • 7 篇 complexity
  • 6 篇 network
  • 5 篇 temporal graph

机构

  • 16 篇 univ warwick mat...
  • 15 篇 univ warwick dim...
  • 7 篇 rutgers state un...
  • 7 篇 univ durham dept...
  • 6 篇 univ glasgow dep...
  • 6 篇 hong kong polyte...
  • 6 篇 univ rostock ins...
  • 5 篇 natl res univ hi...
  • 4 篇 zhengzhou univ s...
  • 4 篇 univ g dannunzio...
  • 4 篇 kwansei gakuin u...
  • 4 篇 natl res univ hi...
  • 3 篇 univ ioannina de...
  • 3 篇 univ glasgow sch...
  • 3 篇 univ primorska u...
  • 3 篇 kyoto univ grad ...
  • 3 篇 russian acad sci...
  • 3 篇 ben gurion univ ...
  • 3 篇 univ wisconsin d...
  • 3 篇 univ wisconsin w...

作者

  • 15 篇 milanic martin
  • 13 篇 lozin vadim
  • 11 篇 lozin vadim v.
  • 10 篇 manlove david f.
  • 10 篇 malyshev d. s.
  • 10 篇 miwa hiroyoshi
  • 9 篇 mosca raffaele
  • 7 篇 paulusma daniel
  • 7 篇 brandstaedt andr...
  • 7 篇 kobayashi yusuke
  • 6 篇 mertzios george ...
  • 6 篇 ries bernard
  • 5 篇 purcell christop...
  • 5 篇 van iersel leo
  • 4 篇 lin lan
  • 4 篇 gritzmann p
  • 4 篇 maeda nao
  • 4 篇 golovach petr a.
  • 4 篇 del pia alberto
  • 4 篇 papadopoulos cha...

语言

  • 328 篇 英文
  • 51 篇 其他
  • 1 篇 土耳其文
  • 1 篇 中文
检索条件"主题词=Polynomial-time algorithm"
381 条 记 录,以下是251-260 订阅
排序:
Intersecting two classical groups
收藏 引用
JOURNAL OF ALGEBRA 2012年 第1期353卷 286-297页
作者: Brooksbank, Peter A. Wilson, James B. Bucknell Univ Dept Math Lewisburg PA 17837 USA Colorado State Univ Dept Math Ft Collins CO 80523 USA
A new algorithm is presented to compute the algebra of adjoints associated to a pair of forms on a common finite vector space. This algebra is used in several recent and ongoing projects to study central products, int... 详细信息
来源: 评论
HEURISTIC algorithm FOR FINDING THE MAXIMUM INDEPENDENT SET
收藏 引用
CYBERNETICS AND SYSTEMS ANALYSIS 2012年 第5期48卷 673-680页
作者: Plotnikov, A. D. Volodymyr Dahl East Ukraine Natl Univ Minist Educ & Sci Youth & Sport Ukraine Lugansk Ukraine
A heuristic algorithm is developed for finding the maximum independent set of vertices in an undirected graph. To this end, the technique of finite partially ordered sets is used, in particular, the technique of parti... 详细信息
来源: 评论
Colouring vertices of triangle-free graphs without forests
收藏 引用
DISCRETE MATHEMATICS 2012年 第7期312卷 1372-1385页
作者: Dabrowski, Konrad K. Lozin, Vadim Raman, Rajiv Ries, Bernard Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Math Inst Coventry CV4 7AL W Midlands England Univ Paris 09 LAMSADE Paris France
The VERTEX COLOURING problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it is NP-complete in any subclass of triangle-free graphs defined by a finite collection of forbidden induced sub... 详细信息
来源: 评论
polynomial-time recognition of clique-width ≤ 3 graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第6期160卷 834-865页
作者: Corneil, Derek G. Habib, Michel Lanlignel, Jean-Marc Reed, Bruce Rotics, Udi Netanya Acad Coll Sch Math & Comp Sci IL-42100 Netanya Israel Univ Toronto Dept Comp Sci Toronto ON Canada UMR 7089 CNRS LIAFA F-75205 Paris 13 France Univ Paris 07 UFR Informat F-75205 Paris 13 France Univ Montpellier 2 LIRMM UMR CNRS F-34392 Montpellier 5 France McGill Univ Sch Comp Sci Canada Res Chair Combinator Complex Networks Montreal PQ Canada
Clique-width is a relatively new parameterization of graphs, philosophically similar to treewidth. Clique-width is more encompassing in the sense that a graph of bounded treewidth is also of bounded clique-width (but ... 详细信息
来源: 评论
Edge search number of cographs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第6期160卷 734-743页
作者: Golovach, Petr A. Heggernes, Pinar Mihai, Rodica Univ Bergen Dept Informat N-5020 Bergen Norway Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England
We give a linear-time algorithm for computing the edge search number of cographs, thereby resolving the computational complexity of edge searching on this graph class. To achieve this we give a characterization of the... 详细信息
来源: 评论
polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
Polynomial-time Isomorphism Test for Groups with Abelian Syl...
收藏 引用
29th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Babai, Laszlo Qiao, Youming Univ Chicago Dept Comp Sci Chicago IL 60637 USA Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing Peoples R China
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial n(log) (n) bound on the time complexity for the general case has not been improved over the past four decades. Re... 详细信息
来源: 评论
Edge search number of cographs
Edge search number of cographs
收藏 引用
4th Workshop on Graph Classes, Optimization, and Width Parameters (GROW)
作者: Golovach, Petr A. Heggernes, Pinar Mihai, Rodica Univ Bergen Dept Informat N-5020 Bergen Norway Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England
We give a linear-time algorithm for computing the edge search number of cographs, thereby resolving the computational complexity of edge searching on this graph class. To achieve this we give a characterization of the... 详细信息
来源: 评论
Finding Induced Paths of Given Parity in Claw-Free Graphs
收藏 引用
algorithmICA 2012年 第1-2期62卷 537-563页
作者: van 't Hof, Pim Kaminski, Marcin Paulusma, Daniel Univ Durham Sch Engn & Comp Sci Sci Labs Durham DH1 3LE England Univ Libre Bruxelles Dept Comp Sci B-1050 Brussels Belgium
The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even In... 详细信息
来源: 评论
Detecting Critical Links for Keeping Shortest Distance from Clients to Servers during Failures
Detecting Critical Links for Keeping Shortest Distance from ...
收藏 引用
12th IEEE/IPSJ International Symposium on Applications and the Internet (SAINT) / IEEE Annual Signature Conference on Computer Software and Applications (COMPSAC)
作者: Maeda, Nao Miwa, Hiroyoshi Kwansei Gakuin Univ Nishinomiya Hyogo 6691337 Japan
Recently, large-volume contents distributed by a content delivery service (CDS) on the Internet increase load of content delivery servers and networks, which is at the risk for degradation of quality of service. To ov... 详细信息
来源: 评论
polynomial-time recognition of clique-width ≤ 3 graphs
Polynomial-time recognition of clique-width ≤ 3 graphs
收藏 引用
4th Workshop on Graph Classes, Optimization, and Width Parameters (GROW)
作者: Corneil, Derek G. Habib, Michel Lanlignel, Jean-Marc Reed, Bruce Rotics, Udi Netanya Acad Coll Sch Math & Comp Sci IL-42100 Netanya Israel Univ Toronto Dept Comp Sci Toronto ON Canada UMR 7089 CNRS LIAFA F-75205 Paris 13 France Univ Paris 07 UFR Informat F-75205 Paris 13 France Univ Montpellier 2 LIRMM UMR CNRS F-34392 Montpellier 5 France McGill Univ Sch Comp Sci Canada Res Chair Combinator Complex Networks Montreal PQ Canada
Clique-width is a relatively new parameterization of graphs, philosophically similar to treewidth. Clique-width is more encompassing in the sense that a graph of bounded treewidth is also of bounded clique-width (but ... 详细信息
来源: 评论