ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
5
views
15
references
Top references
cited by
26
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,682
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Monadic second-order evaluations on tree-decomposable graphs
Author(s):
B. Courcelle
,
M. Mosbah
Publication date
Created:
March 1993
Publication date
(Print):
March 1993
Journal:
Theoretical Computer Science
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Genome Engineering using CRISPR
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Bruno Courcelle
(1990)
0
comments
Cited
223
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Complexity of Finding Embeddings in a k-Tree
Stefan Arnborg
,
Derek G. Corneil
,
Andrzej Proskurowski
(1987)
0
comments
Cited
176
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Easy problems for tree-decomposable graphs
Stefan Arnborg
,
Jens Lagergren
,
Detlef Seese
(1991)
0
comments
Cited
133
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Theoretical Computer Science
Abbreviated Title:
Theoretical Computer Science
Publisher:
Elsevier BV
ISSN (Print):
03043975
Publication date Created:
March 1993
Publication date (Print):
March 1993
Volume
: 109
Issue
: 1-2
Pages
: 49-82
Article
DOI:
10.1016/0304-3975(93)90064-Z
SO-VID:
9a8a47a1-26f5-4417-b80e-54fe28f2676b
Copyright ©
© 1993
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,682
Decomposing the effects of crowd-wisdom aggregators: The bias–information–noise (BIN) model
Authors:
Ville A. Satopää
,
Marat Salikhov
,
Philip E. Tetlock
…
Intraspecific competition in two unit-restricted fungal decomposers, Coprinus cinereus and C. congregatus
Authors:
John P. Schmit
Functional breadth and home-field advantage generate functional differences among soil microbial decomposers
Authors:
Nicolas Fanin
,
Isabelle Bertrand
,
Nathalie Fromin
See all similar
Cited by
26
Counting truth assignments of formulas of bounded tree-width or clique-width
Authors:
J.A. Makowsky
,
E.V. Ravve
,
E. Fischer
Intractability of Clique-Width Parameterizations
Authors:
Fedor Fomin
,
Petr Golovach
,
Daniel Lokshtanov
…
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
Authors:
Guillaume Bagan
See all cited by
Most referenced authors
67
J. Wright
R Parker
D. D. Johnson
See all reference authors