咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 124 篇 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 篇 decomposition
  • 3 篇 chromatic number

机构

  • 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
  • 5 篇 korenblit mark
  • 5 篇 ito takehiro
  • 5 篇 nishizeki t
  • 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 篇 levit vadim e.
  • 3 篇 de mier anna
  • 3 篇 wu jianliang
  • 3 篇 zhu xd
  • 3 篇 noy marc
  • 3 篇 langerman stefan

语言

  • 109 篇 英文
  • 14 篇 其他
  • 1 篇 中文
检索条件"主题词=Series-parallel Graph"
124 条 记 录,以下是1-10 订阅
排序:
A linear-time certifying algorithm for recognizing generalized series-parallel graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 325卷 152-171页
作者: Chin, Francis Y. L. Ting, Hing-Fung Tsin, Yung H. Zhang, Yong Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China
The problems of recognizing series-parallel graphs, outerplanar graphs, and generalized series-parallel graphs have been studied separately in the past. Efficient algorithms have been presented. However, none of the a... 详细信息
来源: 评论
A New Formula for the Number of Labeled series-parallel graphs
收藏 引用
Journal of Mathematical Sciences (United States) 2023年 第5期277卷 718-721页
作者: Voblyi, V.A. Russian Institute for Scientific and Technical Information Moscow Russian Federation
A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. A new explicit simpler formula for the number of labeled series-parallel biconnected graphs with a given number ... 详细信息
来源: 评论
The smooth structure of the moduli space of a weighted series-parallel graph
收藏 引用
TOPOLOGY AND ITS APPLICATIONS 2014年 第0期164卷 242-247页
作者: Cruickshank, James McLaughlin, Jonathan Natl Univ Ireland Sch Math Appl Math & Stat Galway Ireland
Given a weighted graph (G, l) and its associated moduli space M(G, l), then a sufficient condition is provided which ensures that M(G, l) is a smooth manifold whenever G is a series-parallel graph. (C) 2014 Elsevier B... 详细信息
来源: 评论
Refinement of the Asymptotics of the Number of Labeled series-parallel graphs
收藏 引用
MATHEMATICAL NOTES 2021年 第5-6期109卷 986-989页
作者: Voblyi, V. A. Russian Acad Sci VINITI Moscow 125190 Russia
来源: 评论
Box-total dual integrality and edge-connectivity
收藏 引用
MATHEMATICAL PROGRAMMING 2023年 第1期197卷 307-336页
作者: Barbato, Michele Grappe, Roland Lacroix, Mathieu Lancini, Emiliano Univ Milan Dept Comp Sci I-20133 Milan Italy Univ Sorbonne Paris Nord LIPN CNRS UMR 7030 F-93430 Villetaneuse France Eseo F-78140 Velizy Villacoublay France
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elements (with repetitions allowed) of E, is a k-edge-connected spanning subgraph of G if H cannot be disconnected by del... 详细信息
来源: 评论
The circular chromatic numbers of signed series-parallel graphs
收藏 引用
DISCRETE MATHEMATICS 2022年 第3期345卷 112733-112733页
作者: Pan, Zhishi Zhu, Xuding Tamkang Univ Dept Math New Taipei Taiwan Zhejiang Normal Univ Dept Math Jinhua Zhejiang Peoples R China
It is known that any signed series-parallel graph (G, sigma) has circular chromatic number at most 10/3. This paper proves that for each rational r is an element of [2,10/3], there is a signed series-parallel graph (G... 详细信息
来源: 评论
Asymptotical Enumeration of Labeled series-parallel Tetracyclic graphs
收藏 引用
Journal of Mathematical Sciences (United States) 2025年 第5期287卷 716-720页
作者: Voblyi, V.A. Russian Institute for Scientific and Technical Information of the Russian Academy of Sciences Moscow Russian Federation
A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. We find an asymptotics for the number of labeled connected series-parallel tetracyclic graphs with a large numbe... 详细信息
来源: 评论
On lengths of edge-labeled graph expressions
收藏 引用
DISCRETE APPLIED MATHEMATICS 2022年 319卷 583-594页
作者: Korenblit, Mark Levit, Vadim E. Holon Inst Technol Dept Comp Sci Holon Israel Ariel Univ Dept Math Ariel Israel
This paper investigates relationship between algebraic expressions and graphs. Our intent is to simplify graph expressions and eventually find their shortest representations. We prove the monotonicity results allowing... 详细信息
来源: 评论
Enumeration of Labeled series-parallel Tricyclic graphs
收藏 引用
Journal of Mathematical Sciences (United States) 2023年 第6期275卷 778-782页
作者: Voblyi, V.A. Russian Institute for Scientific and Technical Information Moscow Russian Federation
A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. An explicit formula for the number of labeled series-parallel tricyclic graphs with a given number of vertices i... 详细信息
来源: 评论
Minimumcolor-degreeperfectb-matchings
收藏 引用
NETWORKS 2021年 第4期77卷 477-494页
作者: Anapolska, Mariia Buesing, Christina Comis, Martin Krabs, Tabea Rhein Westfal TH Aachen Lehrstuhl Math 2 Pontdriesch 10-12 D-52062 Aachen Germany
The minimum color-degree perfectb-matching problem (Col-BM) is a new extension of the perfectb-matching problem to edge-colored graphs. The objective of Col-BM is to minimize the maximum number of differently colored ... 详细信息
来源: 评论