Directed Hypergraphs And Applications (1992)


Download Links

by Giorgio Gallo , Giustino Longo , Sang Nguyen , Stefano Pallottino
Citations:100 - 5 self

Active Bibliography

12 Directed Hypergraphs as a Modelling Paradigm – Giorgio Gallo, Maria Grazia Scutellà - 1999
7 Hyperpath Formulations Of Traffic Assignment Problems – Patrice Marcotte , Sang Nguyen
21 Optimal Traversal of Directed Hypergraphs – Giorgio Ausiello, Roberto Giaccio, Giuseppe F. Italiano, Umberto Nanni - 1992
161 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae – Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
3 Linear Connectivity Problems in Directed Hypergraphs – Mayur Thakur, Rahul Tripathi
127 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
5 Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms – Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni - 1998
AFE AGC – Université Libanaise, Spécialité Mathématiques, Domaine Stic, Spécialité Télécommunications, Patricia Maatouk, Patricia Kaiser, Directeurs Profs, Yves Louët, Amine El Sahili, Membres Du Jury, Stéphane Pérennes, Université De Nice, Francis Lau Professeur, Université De Hong Kong, Samer Lahoud, Maîtres De Conférences, Université De Rennes, Oussama Bazzi, Université Libanaise, Ali Al Ghouwayel, Maîtres De Conférences, Yves Louët, Amine El Sahili, Université Libanaise
4 The Satisfiability problem for the Schöenfinkel-Bernays fragment: Partial Instantiation and Hypergraph Algorithms – Giorgio Gallo, Gabriella Rago - 1994
Optimization of a Software Defined Radio multi-standard system using Graph Theory – Université Libanaise, Spécialité Mathématiques, Patricia Kaiser, Directeurs Profs, Yves Louët, Amine El Sahili, Membres Du Jury, Stéphane Pérennes, Université De Nice, Oussama Bazzi, Université Libanaise, Yves Louët, Amine El Sahili, Université Libanaise
116 An Incremental Algorithm for a Generalization of the Shortest-Path Problem – G. Ramalingam, Thomas Reps - 1992
18 SCHEDULING WITH AND/OR PRECEDENCE CONSTRAINTS – Rolf H. Möhring, Martin Skutella, Frederik Stork - 2004
2 Exploiting Functional Dependence in Query Optimization – Glenn Norman Paulley - 2000
Empirical analysis and optimization of an NP-hard algorithm using CSP and FDR – Douglas A. Creager, Andrew C. Simpson
39 Reconstructing a History of Recombinations From a Set of Sequences – John Kececioglu, Dan Gusfield - 1998
1 Finding Tractable Formulas in NNF – E. Altamirano, G. Escalada-imaz - 2000
6 Logical Inference and Polyhedral Projection – J.N. Hooker - 1992
92 Tractable Reasoning via Approximation – Marco Schaerf, Marco Cadoli - 1995