设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(14)
Elsevier电子期刊(14)
在“
Elsevier电子期刊
”中,
命中:
14
条,耗时:小于0.01 秒
在所有数据库中总计命中:
28
条
1.
Bounds on the number of edges in
hypertree
s
作者:
Gyula Y. Katona
a
;
b
;
kiskat@cs.bme.hu" class="auth_mail" title="E-mail the corresponding author
;
Pé
;
ter G.N. Szabó
;
a
;
szape@cs.bme.hu" class="auth_mail" title="E-mail the corresponding author
关键词:
Hypertree
;
Cycle in hypergraph
;
Path in hypergraph
刊名:Discrete Mathematics
出版年:2016
2.
Computing hypergraph
width
measures exactly
作者:
Lukas Moll
a
;
Siamak Tazari
b
;
1
;
siamak.tazari@gmail.com
;
Marc Thurley
c
;
2
关键词:
Design of algorithms
;
Graph algorithms
;
Generalized
hypertree
-
width
;
Fractional
hypertree
-
width
;
Exact exponential algorithms
刊名:Information Processing Letters
出版年:2012
3.
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization
作者:
Gianluigi Greco
;
Francesco Scarcello
关键词:
Structural decomposition methods
;
Tree
width
;
Generalized
hypertree
width
;
Games on hypergraphs
;
Computational complexity
刊名:Theoretical Computer Science
出版年:20 February, 2014
4.
Hypertree
-depth and minors in hypergraphs
作者:
Isolde Adler
a
;
iadler@informatik.uni-frankfurt.de
;
Tomá
;
&scaron
;
Gaven?iak
b
;
gavento@kam.mff.cuni.cz
;
Tereza Klimo&scaron
;
ová
;
c
;
tereza@iuuk.mff.cuni.cz
关键词:
Hypertree
-depth
;
Robber and marshals game
;
Minors
;
Tree-depth
;
Hypertree
-
width
;
Hyperpath-
width
刊名:Theoretical Computer Science
出版年:2012
5.
Tractable counting of the answers to conjunctive queries
作者:
Reinhard Pichler
;
1
;
pichler@dbai.tuwien.ac.at
;
Sebastian Skritek
1
;
skritek@dbai.tuwien.ac.at
关键词:
Computational complexity
;
Counting complexity
;
Query answering
;
Acyclic conjunctive query
;
Hypertree
-
width
刊名:Journal of Computer and System Sciences
出版年:2013
6.
Datalog and constraint satisfaction with infinite templates
作者:
Manuel Bodirsky
a
;
1
;
bodirsky@lix.polytechnique.fr
;
Ví
;
ctor Dalmau
b
;
2
;
victor.dalmau@upf.edu
关键词:
Logic in computer science
;
Computational complexity
;
Constraint satisfaction
;
Datalog
;
Countably categorical structures
刊名:Journal of Computer and System Sciences
出版年:2013
7.
Satisfiability of acyclic and almost acyclic CNF formulas
作者:
Sebastian Ordyniak
a
;
sebastian.ordyniak@kr.tuwien.ac.at
;
Daniel Paulusma
b
;
daniel.paulusma@durham.ac.uk
;
Stefan Szeider
a
;
stefan@szeider.net
关键词:
Acyclic hypergraph
;
Chordal bipartite graph
;
Davis&ndash
;
Putnam resolution
刊名:Theoretical Computer Science
出版年:2013
8.
Entanglement and the complexity of directed graphs
作者:
Dietmar Berwanger
a
;
dwb@lsv.ens-cachan.fr
;
Erich Grä
;
del
b
;
graedel@logic.rwth-aachen.de
;
?ukasz Kaiser
c
;
kaiser@liafa.univ-paris-diderot.fr
;
Roman Rabinovich
b
;
rabinovich@logic.rwth-aachen.de
关键词:
Structural graph theory
;
Graph searching games
;
Parity games
;
Digraph algorithms
刊名:Theoretical Computer Science
出版年:2012
9.
Hypertree
width
and related hypergraph invariants
作者:
Isolde Adler
;
Georg Gottlob
;
Martin Grohe
刊名:European Journal of Combinatorics
出版年:2007
10.
Weighted
hypertree
decompositions and optimal query plans
作者:
Francesco Scarcello
;
Gianluigi Greco
;
Nicola Leone
关键词:
Query processing
;
Computational complexity
;
Decomposition methods
;
Hypergraphs
;
Relational databases
刊名:Journal of Computer and System Sciences
出版年:2007
1
2
按检索点细分(14)
题名(2)
关键词(5)
文摘(12)
按出版年细分(14)
2016年(1)
2013年(3)
2012年(3)
2007年(2)
2003年(2)
2002年(1)
2000年(1)
2000年及以前(1)
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
.