咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是141-150 订阅
排序:
Edge-disjoint spanning trees and the number of maximum state circles of a graph
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年 第4期35卷 997-1008页
作者: Ma, Xiaoli Wu, Baoyindureng Jin, Xian'an Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Xinjiang Peoples R China Xiamen Univ Sch Math Sci Xiamen 361005 Fujian Peoples R China
Motivated by the connection with the genus of unoriented alternating links, Jin et al. (Acta Math Appl Sin Engl Ser, 2015) introduced the number of maximum state circles of a plane graph G, denoted by , and proved tha... 详细信息
来源: 评论
The weighted coloring problem for two graph classes characterized by small forbidden induced structures
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 247卷 423-432页
作者: Malyshev, D. S. Natl Res Univ Higher Sch Econ 25-12 Bolshaya Pecherskaya Ulitsa Nizhnii Novgorod 603155 Russia
We show that the weighted coloring problem can be solved for {P-5, banner}-free graphs and for {P-5, dart}-free graphs in polynomial time on the sum of vertex weights. (C) 2018 Elsevier B.V. All rights reserved.
来源: 评论
Dominating induced matchings in graphs containing no long claw
收藏 引用
JOURNAL OF GRAPH THEORY 2018年 第1期88卷 18-39页
作者: Hertz, Alain Lozin, Vadim Ries, Bernard Zamaraev, Viktor de Werra, Dominique Polytech Montreal Dept Math & Ind Engn CP 6079Succ Ctr Ville Montreal PQ H3C 3A7 Canada Gerad CP 6079Succ Ctr Ville Montreal PQ H3C 3A7 Canada Univ Warwick Math Inst Coventry W Midlands England Univ Fribourg Dept Informat Fribourg Switzerland Ecole Polytech Fed Lausanne Inst Math Lausanne Switzerland
An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The dominating induced matching problem (also known as efficient edge domination) asks whether a gra... 详细信息
来源: 评论
polynomial time algorithms and extended formulations for unit commitment problems
收藏 引用
IISE TRANSACTIONS 2018年 第8期50卷 735-751页
作者: Guan, Yongpei Pan, Kai Zhou, Kezhuo Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Hong Kong Polytech Univ Dept Logist & Maritime Studies Kowloon Hong Kong Peoples R China
Recently, increasing penetration of renewable energy generation has created challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable... 详细信息
来源: 评论
polynomial-time algorithms for Checking Some Properties of Boolean Functions Given by polynomials
收藏 引用
THEORY OF COMPUTING SYSTEMS 2016年 第3期58卷 383-391页
作者: Selezneva, Svetlana N. Bukhman, Anton V. Moscow MV Lomonosov State Univ Fac Computat Math & Cybernet Moscow Russia
In this paper, we show that checking some properties of Boolean functions which are given by the lists of monomials in their polynomial representations can be implemented in polynomial time. Multi-linear polynomials o... 详细信息
来源: 评论
polynomial-time algorithms for SUBGRAPH ISOMORPHISM in small graph classes of perfect graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2016年 199卷 37-45页
作者: Konagaya, Matsuo Otachi, Yota Uehara, Ryuhei Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa 9231292 Japan
Given two graphs, SUBGRAPH ISOMORPHISM is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second one (the pattern graph). This problem is NP-complete even for ver... 详细信息
来源: 评论
Finding a cycle base of a permutation group in polynomial time
收藏 引用
JOURNAL OF ALGEBRA 2018年 510卷 542-561页
作者: Muzychuk, Mikhail Ponomarenko, Ilia Ben Gurion Univ Negev Beer Sheva Israel Steklov Inst Math St Petersburg St Petersburg Russia
A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constru... 详细信息
来源: 评论
Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2018年 第6期64卷 4513-4529页
作者: Guang, Xuan Yeung, Raymond W. Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can ... 详细信息
来源: 评论
Characterising Chordal Contact B0-VPG Graphs  1
收藏 引用
5th International Symposium on Combinatorial Optimization (ISCO)
作者: Bonomo, Flavia Pia Mazzoleni, Maria Leonardo Rean, Mariano Ries, Bernard Univ Buenos Aires Dept Computac Fac Ciencias Exactas & Nat Buenos Aires DF Argentina Univ Buenos Aires CONICET Inst Invest Ciencias Computac ICC Buenos Aires DF Argentina Univ Nacl La Plata Dept Matemat Fac Ciencias Exactas La Plata Buenos Aires Argentina Consejo Nacl Invest Cient & Tecn Buenos Aires DF Argentina Univ Fribourg Fribourg Switzerland
A graph G is a B-0-VPG graph if it is the vertex intersection graph of horizontal and vertical paths on a grid. A graph G is a contact B-0-VPG graph if the vertices can be represented by interiorly disjoint horizontal... 详细信息
来源: 评论
Improved algorithms for k-Domination and Total k-Domination in Proper Interval Graphs  5th
Improved Algorithms for <i>k</i>-Domination and Total <i>k</...
收藏 引用
5th International Symposium on Combinatorial Optimization (ISCO)
作者: Chiarelli, Nina Hartinger, Tatiana Romina Alejandra Leoni, Valeria Lopez Pujato, Maria Ines Milanic, Martin Univ Primorska FAMNIT Glagoljaska 8 Koper 6000 Slovenia Univ Primorska IAM Muzejski Trg 2 Koper 6000 Slovenia Univ Nacl Rosario FCEIA Rosario Santa Fe Argentina Consejo Nacl Invest Cient & Tecn Buenos Aires DF Argentina ANPCyT Buenos Aires DF Argentina
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total domin... 详细信息
来源: 评论