A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product.
Pierre IllePublished in: Discret. Math. (2009)
Keyphrases
- graph theory
- graph matching
- life cycle
- graph theoretic
- multicriteria optimization
- subgraph isomorphism
- product design
- graph kernels
- graph databases
- graph mining
- theorem proving
- series parallel
- neural network
- cardinality constraints
- product information
- breadth first search
- random graphs
- product development
- complete axiomatization
- production planning
- graph representation
- graph partitioning
- morphological operators
- spanning tree
- theorem prover
- graph structure
- bipartite graph
- constraint programming
- combinatorial optimization