Pages that link to "Item:Q3026384"
From MaRDI portal
The following pages link to Graph Algorithms for Functional Dependency Manipulation (Q3026384):
Displaying 18 items.
- Optimal covers in the relational database model (Q303689) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- An efficient algorithm for 3NF determination (Q558039) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Derivation digraphs for dependencies in ordinal and similarity-based data (Q726160) (← links)
- Computing unique canonical covers for simple FDs via transitive reduction (Q834931) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- On the size of nonredundant FD-covers (Q1108065) (← links)
- Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time (Q1199942) (← links)
- The effect of unary inclusion dependencies on relational database design (Q1205894) (← links)
- Flows on hypergraphs (Q1373748) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- Directed Moore hypergraphs (Q1902896) (← links)
- Primitive tensors and directed hypergraphs (Q2261531) (← links)
- Minimal functional routes in directed graphs with dependent edges (Q4924061) (← links)
