咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2024年 第6期35卷 669-703页
作者: Goyal, Pooja Panda, B. S. Indian Inst Technol Delhi Dept Math New Delhi 110016 India
A set D subset of V of a graph G = (V, E) is called a connected power dominating set of G if G[D], the subgraph induced by D, is connected and every vertex in the graph can be observed from D, following the two observ... 详细信息
来源: 评论
Counting 3-stack-sortable permutations
收藏 引用
JOURNAL OF COMBINATORIAL THEORY SERIES A 2020年 第0期172卷 105209-000页
作者: Defant, Colin Princeton Univ Fine Hall304 Washington Rd Princeton NJ 08544 USA
We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stacksorting map s. As a first application, we give a new proof of Zeilberger's formula... 详细信息
来源: 评论
On Fixed-Parameter Solvability of the Minimax Path Location Problem
收藏 引用
Communications on Applied Mathematics and Computation 2023年 第4期5卷 1644-1654页
作者: Hao Lin Cheng He School of Science Henan University of TechnologyZhengzhou450001HenanChina
The minimax path location problem is to find a path P in a graph G such that the maximum distance d_(G)(v,P)from every vertex v∈V(G)to the path P is *** is a well-known NP-hard problem in network *** paper studies th... 详细信息
来源: 评论
Splitting quaternion algebras over quadratic number fields
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2019年 94卷 173-182页
作者: Kutas, Peter Hungarian Acad Sci Inst Comp Sci & Control Budapest Hungary
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over Q(root d) where d is a square-fre... 详细信息
来源: 评论
Recognition of a sequence as a structure containing series of recurring vectors from an alphabet
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2013年 第7期53卷 1044-1055页
作者: Kel'manov, A. V. Mikhailova, L. V. Russian Acad Sci Sobolev Inst Math Siberian Branch Novosibirsk 630090 Russia
A polynomial-time algorithm is designed for finding an optimal solution of a discrete optimization problem to which a pattern recognition problem is reduced, namely, the noise-proof recognition of a sequence as a stru... 详细信息
来源: 评论
Combinatorics and algorithms for Augmenting Graphs
收藏 引用
GRAPHS AND COMBINATORICS 2016年 第4期32卷 1339-1352页
作者: Dabrowski, Konrad K. Lozin, Vadim V. de Werra, Dominique Zamaraev, Viktor Univ Durham Sch Engn & Comp Sci Sci Labs South Rd Durham DH1 3LE England Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Math Inst Coventry CV4 7AL W Midlands England Ecole Polytech Fed Lausanne Math Inst Lausanne Switzerland
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more gener... 详细信息
来源: 评论
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
收藏 引用
DISCRETE MATHEMATICS 2015年 第11期338卷 1860-1865页
作者: Malyshev, D. S. Natl Res Univ Higher Sch Econ Nizhnii Novgorod 603155 Russia
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. (C) 2015 Elsevier B.V. All rights reserved.
来源: 评论
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... 详细信息
来源: 评论
LEVEL SCHEDULING TO MINIMIZE SCHEDULE LENGTH ON LOTS OF UNIT-time JOBS
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1991年 第1期53卷 119-121页
作者: RICHEY, MB GEORGE MASON UNIV DEPT OPERAT RES & APPL STATFAIRFAXVA 22030 USA
A few years ago a researcher attempted to show that one could minimize the total schedule length of lots of unit-time jobs by level scheduling. Unfortunately, this method can fail on problems where jobs have successor... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论