咨询与建议

限定检索结果

文献类型

  • 156 篇 期刊文献
  • 18 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 112 篇 理学
    • 101 篇 数学
    • 11 篇 物理学
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
  • 110 篇 工学
    • 80 篇 计算机科学与技术...
    • 20 篇 软件工程
    • 16 篇 电气工程
    • 12 篇 信息与通信工程
    • 6 篇 电子科学与技术(可...
    • 5 篇 机械工程
    • 4 篇 控制科学与工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 化学工程与技术
    • 1 篇 仪器科学与技术
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 32 篇 管理学
    • 32 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 7 篇 经济学
    • 5 篇 应用经济学
    • 2 篇 理论经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 军事学

主题

  • 176 篇 polynomial time ...
  • 21 篇 computational co...
  • 11 篇 problem solving
  • 11 篇 np-completeness
  • 10 篇 dynamic programm...
  • 7 篇 algorithms
  • 7 篇 graph theory
  • 6 篇 graphs
  • 6 篇 approximation al...
  • 6 篇 production sched...
  • 6 篇 machine theory
  • 6 篇 polynomials
  • 6 篇 scheduling
  • 6 篇 edge-connectivit...
  • 5 篇 computer algorit...
  • 4 篇 np-hard problems
  • 4 篇 mathematical ana...
  • 4 篇 research
  • 4 篇 computer schedul...
  • 4 篇 approximation th...

机构

  • 4 篇 hiroshima univ g...
  • 4 篇 indian inst info...
  • 3 篇 univ edinburgh s...
  • 3 篇 indian inst tech...
  • 3 篇 columbia univ de...
  • 2 篇 chinese acad sci...
  • 2 篇 chinese univ hon...
  • 2 篇 microsoft corp r...
  • 2 篇 ibm tj watson re...
  • 2 篇 simon fraser uni...
  • 2 篇 simon fraser uni...
  • 2 篇 univ talca ind m...
  • 2 篇 chinese acad sci...
  • 2 篇 charles universi...
  • 2 篇 natl inst inform...
  • 2 篇 zhejiang univ co...
  • 2 篇 univ bergen dept...
  • 2 篇 arizona state un...
  • 2 篇 univ montpellier...
  • 2 篇 beijing jiaotong...

作者

  • 5 篇 panda b. s.
  • 4 篇 heggernes pinar
  • 4 篇 vijayakumar s.
  • 3 篇 dellolmo p
  • 3 篇 watanabe t
  • 3 篇 taoka satoshi
  • 3 篇 mondal joyashree
  • 3 篇 chaudhary juhi
  • 3 篇 watanabe toshima...
  • 3 篇 etessami kousha
  • 3 篇 stewart alistair
  • 3 篇 yannakakis mihal...
  • 3 篇 drozdowski m
  • 3 篇 blazewicz j
  • 2 篇 ibaraki t
  • 2 篇 hell p
  • 2 篇 yang xiaoguang
  • 2 篇 ozeki kenta
  • 2 篇 jain kamal
  • 2 篇 taoka s

语言

  • 159 篇 英文
  • 17 篇 其他
检索条件"主题词=polynomial time algorithms"
176 条 记 录,以下是141-150 订阅
排序:
Star Covers and Star Partitions of Cographs and Butterfly-free Graphs  10th
Star Covers and Star Partitions of Cographs and Butterfly-fr...
收藏 引用
10th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Mondal, Joyashree Vijayakumar, S. Indian Inst Informat Technol Design & Mfg IIITDM Chennai 600127 India
A graph that is isomorphic to K-1,K- r for some r >= 0 is called a star. For a graph G = (V, E), any subset S of its vertex set V is called a star of G if the subgraph induced by S is a star. A collection C = {V-1,... 详细信息
来源: 评论
Graph augmentation problems with degree-unchangeable vertices
Graph augmentation problems with degree-unchangeable vertice...
收藏 引用
13th Workshop on Circuits and Systems
作者: Mashima, T Watanabe, T Hiroshima City Univ Fac Informat Sci Dept Comp Engn Hiroshima 7313194 Japan Hiroshima Univ Fac Engn Dept Circuits & Syst Higashihiroshima 7398527 Japan
The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G ... 详细信息
来源: 评论
On Star Partition of Split Graphs  10th
On Star Partition of Split Graphs
收藏 引用
10th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Divya, D. Vijayakumar, S. Indian Inst Informat Technol Design & Mfg IIITDM Chennai 600127 India
A graph that is isomorphic to K-1,K- r for some r >= 0 is called a star. A partition {V-1, . . . , V-k} of the vertex set of a graph G into k sets is called a star partition of G of size k if each set in the partit... 详细信息
来源: 评论
Efficient algorithms for ridesharing of personal vehicles  11th
Efficient algorithms for ridesharing of personal vehicles
收藏 引用
11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Gu, Qian-Ping Liang, Jiajian Leo Zhang, Guochuan Simon Fraser Univ Sch Comp Sci Burnaby BC Canada Zhejiang Univ Coll Comp Sci & Technol Hangzhou Zhejiang Peoples R China
Given a set of trips in a road network, where each trip has an individual, a vehicle and some requirements, the ridesharing problem is to select a subset of vehicles to deliver the individuals of all trips to their de... 详细信息
来源: 评论
Contracting chordal graphs and bipartite graphs to paths and trees
Contracting chordal graphs and bipartite graphs to paths and...
收藏 引用
6th Latin American algorithms Graphs and Optimization Symposium (LAGOS11)6th Latin American algorithms Graphs and Optimization Symposium (LAGOS11)
作者: Heggernes, Pinar van't Hof, Pim Leveque, Benjamin Paul, Christophe Univ Bergen Dept Informat N-5020 Bergen Norway Univ Montpellier 2 CNRS LIRMM F-34095 Montpellier 5 France
We study the following two graph modification problems: given a graph G and an integer k, decide whether G can be transformed into a tree or into a path, respectively, using at most k edge contractions. These problems... 详细信息
来源: 评论
Multi-item Vickrey-English-Dutch auctions
收藏 引用
GAMES AND ECONOMIC BEHAVIOR 2013年 第1期81卷 116-129页
作者: Andersson, Tommy Erlanson, Albin Lund Univ Dept Econ SE-22207 Lund Sweden
Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction ... 详细信息
来源: 评论
Dominating Induced Matching in Some Subclasses of Bipartite Graphs  1
收藏 引用
5th International Conference on 5th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Panda, B. S. Chaudhary, Juhi Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India
Given a graph G = (V, E), a set M subset of E is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is same as G... 详细信息
来源: 评论
An Approach for Finding the Efficient Cost Cores on Weighted Split Networks  13
An Approach for Finding the Efficient Cost Cores on Weighted...
收藏 引用
13th International Conference on Computers and Their Applications, CATA 1998
作者: Yang, Shin-Jer Dept. of Computer & Information Science Soochow University Taipei Taiwan
This paper proposes an approach for solving the cost core issues using Min-Max and Min-Average distance measures on weighted split networks. In fact, finding the efficient cores is very essential to a split network. T... 详细信息
来源: 评论
Vlastnosti intervalových booleovských funkcí
Vlastnosti intervalových booleovských funkcí
收藏 引用
作者: Hušek, Radek Charles University of Prague
Boolean function f is k-interval if - input vector viewed as n-bit number - f is true for and only for inputs from given (at most) k intervals. Recognition of k-interval fuction given its DNF representation is coNP-ha... 详细信息
来源: 评论
Vlastnosti intervalových booleovských funkcí
Vlastnosti intervalových booleovských funkcí
收藏 引用
作者: Hušek, Radek Charles University of Prague
Boolean function f is k-interval if - input vector viewed as n-bit number - f is true for and only for inputs from given (at most) k intervals. Recognition of k-interval fuction given its DNF representation is coNP-ha... 详细信息
来源: 评论