设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(1)
SpringerLink电子期刊(25)
ProQuest学位论文(1)
Elsevier电子期刊(22)
在“
SpringerLink电子期刊
”中,
命中:
25
条,耗时:0.0119943 秒
在所有数据库中总计命中:
49
条
1.
A Slice Theoretic Approach for Embedding Problems on Digraphs
关键词:
Directed
pathwidth
;
Subgraph isomorphism
;
Subgraph homeomorphism
;
Slice languages
刊名:Lecture Notes in Computer Science
出版年:2016
2.
Improving robustness of next-hop routing
作者:
Glencora Borradaile
;
W. Sean Kennedy…
关键词:
Graph
;
Orientation
;
Acyclic
;
Tree
刊名:Journal of Combinatorial Optimization
出版年:2016
3.
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
刊名:Lecture Notes in Computer Science
出版年:2016
4.
Bounded
Treewidth
and Space-Efficient Linear Algebra
作者:
Nikhil Balaji (16)
Samir Datta (16)
16. Chennai Mathematical Institute (CMI)
;
Chennai
;
India
刊名:Lecture Notes in Computer Science
出版年:2015
5.
Balancing Bounded
Treewidth
Circuits
作者:
Maurice Jansen (1)
Jayalal Sarma (1)
关键词:
Arithmetic circuits
;
Boolean circuits
;
Bounded
treewidth
;
Depth reduction
;
Circuit value problem
刊名:Theory of Computing Systems
出版年:2014
6.
An Extended Tree-Width Notion for
Directed
Graphs Related to the Computation of Permanents
作者:
Klaus Meer (1)
关键词:
Treewidth
notions for digraphs
;
Efficient algorithms
;
Computation of the permanent
刊名:Theory of Computing Systems
出版年:2014
7.
Parameterized Algorithms for Parity Games
刊名:Lecture Notes in Computer Science
出版年:2015
8.
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
作者:
Nadja Betzler (1)
Hans L. Bodlaender (2)
Robert Bredereck (1)
Rolf Niedermeier (1)
Johannes Uhlmann (1)
关键词:
Graph modification problem
;
Parameterized complexity
;
Treewidth
刊名:Algorithmica
出版年:2014
9.
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded
Treewidth
作者:
Hasna Mohsen Alqahtani (21)
Thomas Erlebach (21)
刊名:Lecture Notes in Computer Science
出版年:2014
10.
Revisiting Space in Proof Complexity:
Treewidth
and Pathwidth
作者:
Moritz Müller (18)
Stefan Szeider (19)
刊名:Lecture Notes in Computer Science
出版年:2013
1
2
3
按检索点细分(25)
文摘(23)
按出版年细分(25)
2016年(3)
2015年(2)
2014年(4)
2013年(4)
2012年(2)
2010年(5)
2008年(1)
2001年(2)
2000年及以前(2)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.