咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是201-210 订阅
排序:
Independent domination in finitely defined classes of graphs: polynomial algorithms
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 182卷 2-14页
作者: Lozin, Vadim Mosca, Raffaele Purcell, Christopher Univ Warwick Inst Math Coventry CV4 7AL W Midlands England Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ G DAnnunzio Dipartimento Econ I-65127 Pescara Italy
We study the problem of finding in a graph an inclusionwise maximal independent set Of minimum cardinality, known as MINIMUM MAXIMAL INDEPENDENT SET or INDEPENDENT DOMINATING SET problem. This is one of the hardest pr... 详细信息
来源: 评论
Detecting Critical Protected Links to Keep Connectivity to Servers Against Link Failures  7
Detecting Critical Protected Links to Keep Connectivity to S...
收藏 引用
7th International Conference on New Technologies, Mobility and Security (NTMS)
作者: Irie, Daishi Kurimoto, Shinya Miwa, Hiroyoshi Kwansei Gakuin Univ Sch Sci & Technol 2-1 Gakuen Sanda Hyogo 6691337 Japan
It is important for service providers to design and operate reliable network which is robust against network failures. Especially, a network must be sufficiently connected, even if link failures occur. It is desirable... 详细信息
来源: 评论
Variants of Graph Matching for Tree-like Graphs
Variants of Graph Matching for Tree-like Graphs
收藏 引用
2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)
作者: Nagoya, Takayuki Tottori Univ Environm Studies Gen Educ Ctr Tottori 6891111 Japan
Graphs can be effectively used to represent relationships between objects such as social networks, web search engines and genome sequencing. In this paper, we deal with two variants of graph matching, the graph isomor... 详细信息
来源: 评论
Independent domination in finitely defined classes of graphs: polynomial algorithms
Independent domination in finitely defined classes of graphs...
收藏 引用
8th International Colloquium on Graphs and Optimization (GO)
作者: Lozin, Vadim Mosca, Raffaele Purcell, Christopher Univ Warwick Inst Math Coventry CV4 7AL W Midlands England Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ G DAnnunzio Dipartimento Econ I-65127 Pescara Italy
We study the problem of finding in a graph an inclusionwise maximal independent set Of minimum cardinality, known as MINIMUM MAXIMAL INDEPENDENT SET or INDEPENDENT DOMINATING SET problem. This is one of the hardest pr... 详细信息
来源: 评论
A polynomial-time algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fol...
收藏 引用
14th International Conference Integer Programming and Combinatorial Optimization
作者: Hemmecke, Raymond Koeppe, Matthias Weismantel, Robert Tech Univ Munich D-8000 Munich Germany Univ Calif Davis CA USA ETH Zurich Switzerland
In this paper we generalize N-fold integer programs and two-stage integer programs with AT scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer program... 详细信息
来源: 评论
Maximum Exploratory Equivalence in Trees
Maximum Exploratory Equivalence in Trees
收藏 引用
3rd International Conference on Innovative Network Systems and Applications (iNetSApp) held in conjunction with Federated Conference on Computer Science and Information Systems (FedCSIS)
作者: Furst, Luka Cibej, Uros Mihelic, Jurij Univ Ljubljana Fac Comp & Informat Sci Vecna Pot 113 SI-1000 Ljubljana Slovenia
Many practical problems are modeled with networks and graphs. Their exploration is of significant importance, and several graph-exploration algorithms already exist. In this paper, we focus on a type of vertex equival... 详细信息
来源: 评论
Optimal Power Control in Two-Tier Networks at Low-SNR Regime  23
Optimal Power Control in Two-Tier Networks at Low-SNR Regime
收藏 引用
23nd Signal Processing and Communications Applications Conference (SIU)
作者: Demir, Uygar Toker, Cenk Inaltekin, Hazer Hacettepe Univ Elekt & Elekt Muhendisligi Bolumu Ankara Turkey Antalya Uluslararasi Univ Elekt & Elekt Muhendisligi Bolumu Dosemealti Antalya Turkey
This paper considers optimum uplink power control policy that maximizes system capacity without any interference cancellation techniques for HetNets or cognitive-radio (CR) networks at low-SNR regime. System model has... 详细信息
来源: 评论
On the maximum independent set problem in subclasses of subcubic graphs
收藏 引用
JOURNAL OF DISCRETE algorithmS 2015年 31卷 104-112页
作者: Lozin, Vadim Monnot, Jerome Ries, Bernard Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Math Inst Coventry CV4 7AL W Midlands England CNRS LAMSADE UMR 7243 F-75700 Paris France Univ Paris 09 PSL F-75775 Paris 16 France
It is known that the maximum independent set problem is NP-complete for subcubic graphs, i.e. graphs of vertex degree at most 3. Moreover, the problem is NP-complete for 3-regular Hamiltonian graphs and for H-free sub... 详细信息
来源: 评论
MATCHING PROBLEMS WITH DELTA-MATROID CONSTRAINTS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2014年 第2期28卷 942-961页
作者: Kakimura, Naonori Takamatsu, Mizuyo Univ Tokyo Coll Arts & Sci Tokyo 1538902 Japan Chuo Univ Dept Informat & Syst Engn Tokyo 1128551 Japan
Given an undirected graph G = (V, E) and a delta-matroid (V, F), the delta-matroid matching problem is to find a maximum cardinality matching M such that the set of the end vertices of M belongs to F. This problem is ... 详细信息
来源: 评论
Optimal shift coloring of trees
收藏 引用
OPERATIONS RESEARCH LETTERS 2014年 第4期42卷 251-256页
作者: Andreatta, Giovanni De Giovanni, Luigi Serafini, Paolo Univ Padua Dipartimento Matemat I-35121 Padua Italy Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy
This paper was motivated by the problem of scheduling the openings of pharmacies during week-ends and holiday periods (shifts). The problem can be modeled as a coloring problem on a graph. In this paper we focus on th... 详细信息
来源: 评论