Listing graphs that satisfy first-order sentences
type: Item
instance of: scholarly article
title: Listing graphs that satisfy first-order sentences
zbMATH Open document ID: 0921.03041
DOI: 10.1016/S0022-0000(05)80057-1
author: Leslie Ann Goldberg
published in: Journal of Computer and System Sciences
publication date: 1994-12-04T00:00:00Z
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 682627
zbMATH Keywords: graph listing algorithm
zbMATH Keywords: almost-sure sentence
zbMATH Keywords: first-order language of graphs
MaRDI profile type: Publication
cites work: Q4039803
cites work: A zero-one law for logic with a fixed-point operator
cites work: Properties of almost all graphs and complexes
cites work: Q3682518
cites work: Q3220545
cites work: Probabilities on finite models
cites work: Efficient algorithms for listing unlabeled graphs
cites work: Efficient Algorithms for Listing Combinatorial Structures
cites work: Q4005187
cites work: Computation times of NP sets of different densities
cites work: On sets polynomially enumerable by iteration
cites work: On generating all maximal independent sets
cites work: Turing machines and the spectra of first-order formulas
cites work: Q3932310
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: Q3481743
cites work: Q3726126
cites work: Toward a Theory of Enumerations
full work available at URL: s0022-0000(05)80057-1
OpenAlex ID: W2059565406
description: scientific article; zbMATH DE number 682627