AutoGraphiX: a survey
From MaRDI portal
Publication:3439391
DOI10.1016/j.endm.2005.06.090zbMath1200.05002OpenAlexW2054112598MaRDI QIDQ3439391
M. Laffay, Gilles Caporossi, Mustapha Aouchiche, Pierre Hansen
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.090
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the further relation between the (revised) Szeged index and the Wiener index of graphs, Conjecture of TxGraffiti: Independence, domination, and matchings, The average eccentricity of a graph with prescribed girth, Automated conjecturing. III. Property-relations conjectures, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, Edge-grafting transformations on the average eccentricity of graphs and their applications, Upper bounds on the average eccentricity, The (revised) Szeged index and the Wiener index of a nonbipartite graph, Using size for bounding expressions of graph invariants, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, A survey of automated conjectures in spectral graph theory, Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance, A sharp upper bound on algebraic connectivity using domination number, Variable neighbourhood search: methods and applications, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond, AutoGraphiX, Variable neighbourhood search: Methods and applications, Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
Uses Software
Cites Work
- On conjectures of Graffiti
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs 3
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item