咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 299 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 1 篇 物理学
  • 184 篇 工学
    • 124 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 27 篇 控制科学与工程
    • 18 篇 电气工程
    • 14 篇 机械工程
    • 8 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 151 篇 管理学
    • 148 篇 管理科学与工程(可...
    • 16 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 416 篇 polynomial algor...
  • 37 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 11 篇 combinatorial op...
  • 10 篇 stable set
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 7 篇 graphs
  • 7 篇 tree
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 336 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=polynomial algorithm"
416 条 记 录,以下是161-170 订阅
排序:
Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2003年 第2期16卷 335-343页
作者: Bang-Jensen, J Huang, J Yeo, A Univ So Denmark Dept Math & Comp Sci DK-5230 Odense Denmark Univ Victoria Dept Math & Stat Victoria BC V8W 3P4 Canada Univ London Royal Holloway Dept Comp Sci Egham TW20 0EX Surrey England
We consider the problem of finding a strongly connected spanning subdigraph with the minimum number of arcs in a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the Hamilt... 详细信息
来源: 评论
Interior and exterior functions of positive Boolean functions
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第3期130卷 417-436页
作者: Makino, K Ono, H Ibaraki, T Kyushu Univ Grad Sch Informat Sci & Elect Engn Dept Comp Sci & Commun Engn Fukuoka 8128581 Japan Osaka Univ Grad Sch Engn Sci Div Syst & Human Sci Osaka 5608531 Japan Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
The interior and exterior functions of a Boolean function f were introduced in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209-231), as stability (or robustness) measures of the f. In this paper, we investigate... 详细信息
来源: 评论
ISOMORPHISM OF CHORDAL (6,3) GRAPHS
收藏 引用
COMPUTING 1995年 第4期54卷 303-316页
作者: BABEL, L Institut für Mathematik Technische Universität München München Germany
A graph is chordal if it contains no chordless cycles of length at least four and (q, t) if no set of at most q vertices induces more than t paths of length three. It is known that the isomorphism problem is isomorphi... 详细信息
来源: 评论
Balanced branchings in digraphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 595卷 107-119页
作者: Bang-Jensen, J. Yeo, A. Univ Southern Denmark Dept Math & Comp Sci DK-4230 Odense Denmark Singapore Univ Technol & Design Engn Syst & Design Singapore 138682 Singapore Univ Johannesburg Dept Math ZA-2006 Auckland Pk South Africa
We study out-branchings rooted at a given vertex s with the extra requirement that these satisfy certain balance conditions, such as balancing the number of arcs out of s, the number of vertices in each subtree of the... 详细信息
来源: 评论
Fast algorithms for Revision of Some Special Propositional Knowledge Bases
收藏 引用
Journal of Computer Science & Technology 2003年 第3期18卷 388-392页
作者: 栾尚敏 戴国忠 InstituteofSoftware TheChineseAcademyofSciencesBeijing100080P.R.China
In this paper, the computational complexity of propositional clause set counter-factuals is discussed. It is shown that the computational complexity of propositional clause setcounterfactuals is at the second level of... 详细信息
来源: 评论
Blocking unions of arborescences
收藏 引用
DISCRETE OPTIMIZATION 2016年 第PartB期22卷 277-290页
作者: Bernath, Attila Pap, Gyula Eotvos Lorand Univ Dept Operat Res MTA ELTE Egervary Res Grp Pazmany Peter Setany 1-C H-1117 Budapest Hungary
Given a digraph D = (V, A) and a positive integer k, a subset B subset of A is called a k-arborescence, if it is the disjoint union of k spanning arborescences. When also arc-costs c : A -> R are given, minimizing ... 详细信息
来源: 评论
New path-following interior-point algorithms for P*(κ)-nonlinear complementarity problems
收藏 引用
NONLINEAR ANALYSIS-REAL WORLD APPLICATIONS 2013年 第1期14卷 718-733页
作者: Kim, Min-Kyung Cho, You-Young Cho, Gyeong-Mi Dongseo Univ Dept Software Engn Pusan 617716 South Korea Pusan Natl Univ Dept Math Pusan 609735 South Korea
In this paper, we propose new large-update path-following interior-point algorithms for P-*(kappa)-nonlinear complementarity problems (NCPs). We define new classes of parametric kernel functions and based on these fun... 详细信息
来源: 评论
A constrained capacity expansion problem on networks
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1998年 第1期70卷 19-33页
作者: Yang, C Zhang, JZ City Univ Hong Kong Dept Math Hong Kong Hong Kong
In this paper we consider a type of constrained maximum capacity path (CMCP) problem which can be described as how to increase the capacity vector of a network so that the capacities of the maximum capacity path for e... 详细信息
来源: 评论
Pyramidal traveling salesman problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1999年 第4期26卷 353-369页
作者: Baki, MF Kabadi, SN Univ Waterloo Dept Management Sci Waterloo ON N2L 3G1 Canada Univ New Brunswick Fac Adm Fredericton NB E3B 5A3 Canada
In this paper, we give new polynomially testable sufficiency conditions for a given instance of the traveling salesman problem (TSP) to have an optimal tour that is pyramidal. This properly generalizes the Demidenko c... 详细信息
来源: 评论
A new approximate cluster deletion algorithm for diamond-free graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2020年 第2期39卷 385-411页
作者: Malek, Sabrine Naanaa, Wady Univ Sfax Fac Econ & Management Sfax Sfax Tunisia Univ Tunis El Manar Natl Engn Sch Tunis Tunis Tunisia
The cluster deletion problem (CD) asks for transforming a given graph into a disjoint union of cliques by removing as few edges as possible. CD is among the most studied combinatorial optimization problem and, for gen... 详细信息
来源: 评论