Showing 1 - 6 results of 6 for search 'HYPERGRAPHS' Narrow Search
Search Tools: Email this Search — Save search to account
1
Conference
Creation and Growth of Components in a Random Hypergraph Process

Authors: Ravelomanana, Vlady, Rijamame, Alphonse Laza

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), Département des mathématiques et informatique (D.M.I), Université d'Antananarivo, Springer, Projet de collaboration Paris XIII -- Université d'Antananarivo

Superior Title: Proceedings of The Twelfth Annual International Computing and Combinatorics Conference (COCOON'06) -- Lecture Notes in Computer Science ; https://hal.science/hal-00085237 ; 2006, à paraître

Subject Terms: Random hypergraphs, probabilistic/analytic combinatorics, asymptotic enumeration, extremal hypergraphs, G.2.1, G.2.2, G.3, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/cs.DS/0607059; hal-00085237; https://hal.science/hal-00085237; https://hal.science/hal-00085237/document; https://hal.science/hal-00085237/file/laza.pdf; ARXIV: cs.DS/0607059

Availability: https://hal.science/hal-00085237
https://hal.science/hal-00085237/document
https://hal.science/hal-00085237/file/laza.pdf


Save to List
2
Academic Journal
Automatic Dantzig–Wolfe reformulation of mixed integer programs

Authors: Bergner, Martin, Caprara, Alberto, Ceselli, Alberto, Furini, Fabio, Lübbecke, Marco E., Malaguti, Enrico, Traversi, Emiliano

Contributors: Rheinisch-Westfälische Technische Hochschule Aachen University (RWTH), Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO), Università degli Studi di Milano = University of Milan (UNIMI), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Superior Title: Mathematical Programming ; https://hal.science/hal-01504852 ; Mathematical Programming, 2015, 149 (1-2), ⟨10.1007/s10107-014-0761-5⟩

Subject Terms: Dantzig–Wolfe decomposition, Column generation, Block-diagonal matrix, Matrix re-ordering, Automatic reformulation, Hypergraph partitioning, [INFO]Computer Science [cs]

Relation: hal-01504852; https://hal.science/hal-01504852; https://hal.science/hal-01504852/document; https://hal.science/hal-01504852/file/3614.pdf

Availability: https://doi.org/10.1007/s10107-014-0761-5
https://hal.science/hal-01504852
https://hal.science/hal-01504852/document
https://hal.science/hal-01504852/file/3614.pdf

Zugang prüfen (DOI)

Save to List
3
Conference
A note on Prüfer-like coding and counting forests of uniform hypertrees

Authors: Lavault, Christian

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), CSIT 2011

Superior Title: Proceedings of the 8th International Conference on Computer Science and Information Technologies (CSIT 2011) ; 8th International Conference on Computer Science and Information Technologies (CSIT 2011) ; https://hal.science/hal-00578191 ; 8th International Conference on Computer Science and Information Technologies (CSIT 2011), Sep 2011, Erevan, Armenia. pp.82-85

Subject Terms: Hypergraph, Forest of (labelled rooted) hypertrees, Pr\"{u}fer code, Encoding-decoding, $b$-uniform, Enumeration, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Subject Geographic: Erevan, Armenia

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1110.0204; hal-00578191; https://hal.science/hal-00578191; https://hal.science/hal-00578191v3/document; https://hal.science/hal-00578191v3/file/PruferHypForest2011.pdf; ARXIV: 1110.0204

Availability: https://hal.science/hal-00578191
https://hal.science/hal-00578191v3/document
https://hal.science/hal-00578191v3/file/PruferHypForest2011.pdf


Save to List
4
Conference
Rewriting Systems for Reachability in Vector Addition Systems with Pairs

Authors: Jacobé de Naurois, Paulin, Mogbil, Virgile

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), Antonín Kucera, Igor Potapov, ANR-08-BLAN-0211,COMPLICE,Complexité Implicite, Concurrence et Extraction(2008)

Superior Title: Reachability Problems 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings ; 4th International Workshop on Reachability Problems (RP'10) ; https://hal.science/hal-00483235 ; 4th International Workshop on Reachability Problems (RP'10), Aug 2010, Brno, Czech Republic. pp. 133-145, ⟨10.1007/978-3-642-15349-5⟩

Subject Terms: VASS and BVASS generalization, Reachability decision problem, Hypergraph rewriting system, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Subject Geographic: Brno, Czech Republic

Relation: hal-00483235; https://hal.science/hal-00483235; https://hal.science/hal-00483235v2/document; https://hal.science/hal-00483235v2/file/vasp-preprintLIPN.pdf

Availability: https://doi.org/10.1007/978-3-642-15349-5
https://hal.science/hal-00483235
https://hal.science/hal-00483235v2/document
https://hal.science/hal-00483235v2/file/vasp-preprintLIPN.pdf

Zugang prüfen (DOI)

Save to List