scientific article; zbMATH DE number 3943859

MaRDI QIDQ3715147zbMATH OpenFDO

Authors G. G. Chogovadze, G. G. Chachanedze, V. V. Kachibaya, G. G. Surguladze

Publication date 1984

zbMATH Keywords

algorithmdirected graphfunctional dependenciesindegreeminimal covering subgraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Computing the minimum cover of functional dependencies
• scientific article; zbMATH DE number 4057065
• A structure matching method based on functional dependencies
• Efficient discovery of functional dependencies with degrees of satisfaction
• On the complexity of inferring functional dependencies
• A theory of reduced and minimal procedural dependencies
• scientific article; zbMATH DE number 812581
• Dependency structure analysis as combinatorial optimization
• scientific article; zbMATH DE number 4083037

Cited in

(2)

• Pruning external minimality checking for ASP using semantic dependencies
• A theory of reduced and minimal procedural dependencies

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715147)