Login / Signup
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.
James H. Schmerl
William T. Trotter
Published in:
Discret. Math. (1993)
Keyphrases
</>
relational structures
partially ordered sets
algebraic structures
association graph
relational data
first order logic
relational databases
point sets
metric space
datalog programs
graph matching
precedence constraints
lower bound
markov networks
markov logic networks