Discrete Mathematics - First Japan Conference on Graph Theory and Applications
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
Variable neighborhood search for extremal graphs: 1 the AutoGraphiX system
Discrete Mathematics
Polymake: an approach to modular software design in computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A tight analysis of the maximal matching heuristic
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved approximation bounds for edge dominating set in dense graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Turán Graphs, Stability Number, and Fibonacci Index
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Connected Vertex Covers in Dense Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
Connected vertex covers in dense graphs
Theoretical Computer Science
Communication: House of Graphs: A database of interesting graphs
Discrete Applied Mathematics
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
Hi-index | 0.05 |
We present a new computer system, called GraPHedron, which uses a polyhedral approach to help the user to discover optimal conjectures in graph theory. We define what should be optimal conjectures and propose a formal framework allowing to identify them. Here, graphs with n nodes are viewed as points in the Euclidian space, whose coordinates are the values of a set of graph invariants. To the convex hull of these points corresponds a finite set of linear inequalities. These inequalities computed for a few values of n can be possibly generalized automatically or interactively. They serve as conjectures which can be considered as optimal by geometrical arguments. We describe how the system works, and all optimal relations between the diameter and the number of edges of connected graphs are given, as an illustration. Other applications and results are mentioned, and the forms of the conjectures that can be currently obtained with GraPHedron are characterized.