Calcul pratique du treillis de Galois d'une correspondance
Page 1 Next
Displaying 1 – 20 of 34
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Canonical greedy algorithms and dynamic programming
Art Lew (2006)
Control and Cybernetics
Certificates of factorisation for a class of triangle-free graphs.
Morgan, Kerri, Farr, Graham (2009)
The Electronic Journal of Combinatorics [electronic only]
Certificates of factorisation for chromatic polynomials.
Morgan, Kerri, Farr, Graham (2009)
The Electronic Journal of Combinatorics [electronic only]
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
Journal of Graph Algorithms and Applications
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Collective tree spanners and routing in AT-free related graphs.
Dragan, Feodor F., Yan, Chenyu, Corneil, Derek G. (2006)
Journal of Graph Algorithms and Applications
Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Karel Čulík (1971)
Aplikace matematiky
Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
Yves Caseau (2006)
RAIRO - Operations Research
This paper presents the approach that we developed to solve the ROADEF 2003 challenge problem. This work is part of a research program whose aim is to study the benefits and the computer-aided generation of hybrid solutions that mix constraint programming and meta-heuristics, such as large neighborhood search (LNS). This paper focuses on three contributions that were obtained during this project: an improved method for propagating Hamiltonian chain constraints, a fresh look at limited discrepancy...
Comments on the analysis of parameters in a Random Graph Model
Helmut Prodinger (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Complete subgraphs of bipartite graphs and applications to trace languages
G. Guaiana, A. Restivo, S. Salemi (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Complexité algébrique
Jean-François Maurras (1985)
Publications mathématiques et informatique de Rennes
Complexité de problèmes liés aux graphes sans circuit
J. P. Bordat (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Computational aspects of lucidity-driven graph clustering.
Görke, Robert, Gaertler, Marco, Hübner, Florian, Wagner, Dorothea (2010)
Journal of Graph Algorithms and Applications
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Computing communities in large networks using random walks.
Pons, Pascal, Latapy, Matthieu (2006)
Journal of Graph Algorithms and Applications
Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Currently displaying 1 – 20 of 34
Page 1 Next