咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献
  • 2 篇 会议
  • 1 册 图书
  • 1 篇 科技报告

馆藏范围

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

日期分布

学科分类号

  • 5 篇 理学
    • 3 篇 物理学
    • 2 篇 数学
  • 2 篇 工学
    • 2 篇 计算机科学与技术...
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 8 篇 combinatorics an...
  • 2 篇 computational co...
  • 2 篇 general statisti...
  • 1 篇 oeis
  • 1 篇 two-dimensional ...
  • 1 篇 self-avoiding wa...
  • 1 篇 quantum entangle...
  • 1 篇 exact enumeratio...
  • 1 篇 randomness in co...
  • 1 篇 computer-assiste...
  • 1 篇 classical statis...
  • 1 篇 human health
  • 1 篇 intranet portal
  • 1 篇 60 applied life ...
  • 1 篇 mathematics
  • 1 篇 lattice models i...
  • 1 篇 high performance...
  • 1 篇 97 mathematics a...
  • 1 篇 algorithms and d...
  • 1 篇 classical statis...

机构

  • 2 篇 suny stony brook...
  • 2 篇 suny stony brook...
  • 2 篇 natl cheng kung ...
  • 1 篇 natl inst techno...
  • 1 篇 university of te...
  • 1 篇 univ copenhagen ...
  • 1 篇 kth royal inst t...
  • 1 篇 sez trieste siss...
  • 1 篇 tel aviv univ te...
  • 1 篇 univ tubingen wi...
  • 1 篇 sez trieste infn...
  • 1 篇 stockholm univ h...

作者

  • 2 篇 chang shu-chiuan
  • 2 篇 shrock robert
  • 1 篇 roising henrik s...
  • 1 篇 peri noam
  • 1 篇 zhang zhao
  • 1 篇 liu yanpei
  • 1 篇 alber j
  • 1 篇 cohen gil
  • 1 篇 niedermeier r
  • 1 篇 iyer viswanathan...
  • 1 篇 langston michael...
  • 1 篇 ta-shma amnon

语言

  • 8 篇 英文
检索条件"主题词=combinatorics and graph theory"
8 条 记 录,以下是1-10 订阅
排序:
Topological theory of graphs
收藏 引用
2017年
作者: Liu, Yanpei
This book presents a topological approach to combinatorial configurations, in particular graphs, by introducing a new pair of homology and cohomology via polyhedra. On this basis, a number of problems are solved using... 详细信息
来源: 评论
A dynamic intranet-based online-portal support for Computer Science teaching
收藏 引用
EDUCATION AND INFORMATION TECHNOLOGIES 2017年 第3期22卷 827-840页
作者: Iyer, Viswanathan K. Natl Inst Technol Dept Comp Sci & Engn Tiruchirappalli 620015 Tamil Nadu India
This paper addresses the issue of effective content-delivery of Computer Science subjects taking advantage of a university intranet. The proposal described herein for teaching a subject like combinatorics and graph Th... 详细信息
来源: 评论
Improved tree decomposition based algorithms for domination-like problems  5
收藏 引用
5th Latin American Symposium on Theoretical Informatics (LATIN 2002)
作者: Alber, J Niedermeier, R Univ Tubingen Wilhelm Schickard Inst Informat D-72076 Tubingen Germany
We present an improved dynamic programming strategy for DOMINATING SET and related problems on graphs that are given together with a tree decomposition of width k. We obtain an O(4(k) n) algorithm for DOMINATING SET, ... 详细信息
来源: 评论
Expander Random Walks: A Fourier-Analytic Approach  2021
Expander Random Walks: A Fourier-Analytic Approach
收藏 引用
53rd Annual ACM SIGACT Symposium on theory of Computing (STOC)
作者: Cohen, Gil Peri, Noam Ta-Shma, Amnon Tel Aviv Univ Tel Aviv Israel
In this work we ask the following basic question: assume the vertices of an expander graph are labelled by 0, 1. What "test" functions f : {0, 1}(t) -> {0, 1} cannot distinguish t independent samples from... 详细信息
来源: 评论
Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds
收藏 引用
INTERNATIONAL JOURNAL OF MODERN PHYSICS B 2021年 第6期35卷
作者: Chang, Shu-Chiuan Shrock, Robert Natl Cheng Kung Univ Dept Phys Tainan 70101 Taiwan SUNY Stony Brook CN Yang Inst Theoret Phys Stony Brook NY 11794 USA SUNY Stony Brook Dept Phys & Astron Stony Brook NY 11794 USA
We compare our upper bounds on the exponential growth constant phi(Lambda) characterizing the asymptotic behavior of spanning forests on Archimedean lattices Lambda with recently derived upper bounds. Our upper bounds... 详细信息
来源: 评论
The frustration-free fully packed loop model
收藏 引用
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 2023年 第19期56卷 194001-194001页
作者: Zhang, Zhao Roising, Henrik Schou Sez Trieste SISSA via Bonomea 265 I-34136 Trieste Italy Sez Trieste INFN via Bonomea 265 I-34136 Trieste Italy KTH Royal Inst Technol Nordita Hannes Alfvens vag 12 SE-10691 Stockholm Sweden Stockholm Univ Hannes Alfvens vag 12 SE-10691 Stockholm Sweden Univ Copenhagen Niels Bohr Inst Jagtvej 155A DK-2200 Copenhagen Denmark
We consider a quantum fully packed loop model on the square lattice with a frustration-free projector Hamiltonian and ring-exchange interactions acting on plaquettes. A boundary Hamiltonian is added to favor domain-wa... 详细信息
来源: 评论
Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
收藏 引用
INTERNATIONAL JOURNAL OF MODERN PHYSICS B 2020年 第27期34卷
作者: Chang, Shu-Chiuan Shrock, Robert Natl Cheng Kung Univ Dept Phys Tainan 70101 Taiwan SUNY Stony Brook CN Yang Inst Theoret Phys Stony Brook NY 11794 USA SUNY Stony Brook Dept Phys & Astron Stony Brook NY 11794 USA
We calculate exponential growth constants phi and sigma describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensiona... 详细信息
来源: 评论
Scalable Computational Methods for the Analysis of High-Throughput Biological Data
Scalable Computational Methods for the Analysis of High-Thro...
收藏 引用
作者: Langston, Michael A University of Tennessee Knoxville TN
来源: 评论