The following pages link to Marina Moscarini (Q266843):
Displayed 29 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- On the existence of acyclic views in a database scheme (Q1060030) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Dynamic query interpretation in relational databases (Q1124384) (← links)
- Inclusion and equivalence between relational database schemata (Q1173416) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- (Q1566704) (redirect page) (← links)
- Decomposition of a hypergraph by partial-edge separators (Q1566705) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
- A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent (Q2192072) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph (Q2283041) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- Minimal invariant sets in a vertex-weighted graph (Q2508971) (← links)
- Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
- (Q3341953) (← links)
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination (Q3791188) (← links)
- (Q3795243) (← links)
- (Q3809317) (← links)
- (Q3891804) (← links)
- (Q4122773) (← links)
- (Q4489244) (← links)
- Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
- Doubly chordal graphs, steiner trees, and connected domination (Q5285479) (← links)