咨询与建议

限定检索结果

文献类型

  • 108 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 88 篇 理学
    • 87 篇 数学
    • 3 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 57 篇 工学
    • 51 篇 计算机科学与技术...
    • 15 篇 软件工程
    • 10 篇 电气工程
    • 8 篇 电子科学与技术(可...
    • 2 篇 机械工程
    • 2 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 材料科学与工程(可...
    • 1 篇 控制科学与工程
  • 22 篇 管理学
    • 22 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 4 篇 经济学
    • 4 篇 应用经济学

主题

  • 125 篇 series-parallel ...
  • 12 篇 algorithm
  • 11 篇 planar graph
  • 9 篇 outerplanar grap...
  • 7 篇 labeled graph
  • 6 篇 enumeration
  • 6 篇 dynamic programm...
  • 5 篇 partial k-tree
  • 5 篇 2-tree
  • 5 篇 scheduling
  • 5 篇 complexity
  • 4 篇 graph
  • 4 篇 girth
  • 4 篇 demand
  • 4 篇 supply
  • 4 篇 two-terminal dir...
  • 4 篇 facet
  • 4 篇 spanning tree
  • 4 篇 directed acyclic...
  • 4 篇 decomposition

机构

  • 11 篇 tohoku univ grad...
  • 4 篇 department of co...
  • 3 篇 wesleyan univ de...
  • 3 篇 univ politecn ca...
  • 3 篇 zhejiang normal ...
  • 3 篇 kwansei gakuin u...
  • 2 篇 carleton univ sc...
  • 2 篇 cea list embedde...
  • 2 篇 univ libre bruxe...
  • 2 篇 natl sun yat sen...
  • 2 篇 ben gurion univ ...
  • 2 篇 departament de m...
  • 2 篇 sobolev inst mat...
  • 2 篇 univ paris 13 so...
  • 2 篇 univ nottingham ...
  • 2 篇 russian institut...
  • 2 篇 sorbonne univ up...
  • 2 篇 nyu dept phys ny...
  • 2 篇 shandong univ sc...
  • 2 篇 xidian univ dept...

作者

  • 11 篇 nishizeki takao
  • 10 篇 zhou xiao
  • 6 篇 korenblit mark
  • 5 篇 ito takehiro
  • 5 篇 nishizeki t
  • 4 篇 levit vadim e.
  • 4 篇 grappe roland
  • 4 篇 wang ji-bo
  • 4 篇 zhou x
  • 4 篇 lacroix mathieu
  • 3 篇 morin pat
  • 3 篇 voblyi v.a.
  • 3 篇 bose prosenjit
  • 3 篇 wood david r.
  • 3 篇 wuhrer stefanie
  • 3 篇 de mier anna
  • 3 篇 wu jianliang
  • 3 篇 zhu xd
  • 3 篇 noy marc
  • 3 篇 langerman stefan

语言

  • 110 篇 英文
  • 14 篇 其他
  • 2 篇 俄文
  • 1 篇 中文
检索条件"主题词=Series-Parallel Graph"
125 条 记 录,以下是121-130 订阅
排序:
AN APPLICATION OF DUALITY TO EDGE-DELETION PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 1987年 第2期16卷 312-331页
作者: ASANO, T UNIV TOKYO FAC ENGN DEPT MATH ENGN & INSTRUMENTAT PHYS BUNKYO KU TOKYO 113 JAPAN
For a property π\pi on graphs, the corresponding edge-deletion problem PED(π)P_{{\text{ED}}} (\pi ) (on planar graphs) is stated as follows: given a (planar) graph G, find a set of edges of minimum cardinality whos... 详细信息
来源: 评论
OPTIMUM COMMUNICATION SPANNING-TREES IN series-parallel NETWORKS
收藏 引用
SIAM JOURNAL ON COMPUTING 1985年 第4期14卷 915-925页
作者: ELMALLAH, ES COLBOURN, CJ UNIV WATERLOO DEPT COMP SCIWATERLOO N2L 3G1ONTARIOCANADA
The optimum communication spanning tree problem is to locate a spanning tree which minimizes the sum of the lengths of the shortest routes between all pairs of vertices in a graph, weighted by traffic requirements. Al... 详细信息
来源: 评论
THE TRAVELING SALESMAN PROBLEM ON A graph AND SOME RELATED INTEGER POLYHEDRA
收藏 引用
MATHEMATICAL PROGRAMMING 1985年 第1期33卷 1-27页
作者: CORNUEJOLS, G FONLUPT, J NADDEF, D UNIV GRENOBLE LAB INFORMAT & MATH APPL GRENOBLEF-38402 ST MARTIN HERESFRANCE
Given a graphG = (N, E) and a length functionl: E → ?, the graphical Traveling Salesman Problem is that of finding a minimum length cycle goingat least once through each node ofG. This formulation has advantages over... 详细信息
来源: 评论
LINEAR-TIME COMPUTABILITY OF COMBINATORIAL PROBLEMS ON series-parallel graphS
收藏 引用
JOURNAL OF THE ACM 1982年 第3期29卷 623-641页
作者: TAKAMIZAWA, K NISHIZEKI, T SAITO, N TOHOKU UNIV DEPT ELECT ENGN SENDAI MIYAGI 980 JAPAN
A series-parallel graph can be constructed from a certain graph by recurslvely applying “series” and “parallel” connections The class of such graphs, which Is a well-known model of series-parallel electrical netwo... 详细信息
来源: 评论
STRICTLY OPTIMAL SCHEDULES FOR THE CUMULATIVE COST-OPTIMAL SCHEDULING PROBLEM
收藏 引用
COMPUTING 1980年 第1期24卷 61-86页
作者: ABDELWAHAB, HM KAMEDA, T UNIV WATERLOO DEPT ELECT ENGNWATERLOO N2L 3G1ONTARIOCANADA
Given a set ofn events (or jobs) which are constrained by a precedence relation, we want to order them into a totally ordered sequence (i. e., one machine schedule). Each event has an integer cost (which may be negati... 详细信息
来源: 评论