Heuristics for the generalized median graph problem
From MaRDI portal
(Redirected from Publication:323345)
Recommendations
- Generalized median graphs and applications
- scientific article; zbMATH DE number 2043370
- On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
- Generalized median graph computation by means of graph embedding in vector spaces
- Median graphs: A genetic approach based on new theoretical properties
Cites work
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2043370 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 2090202 (Why is no real title available?)
- scientific article; zbMATH DE number 2090205 (Why is no real title available?)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A long trip in the charming world of graphs for pattern recognition
- A probabilistic heuristic for a computationally difficult set covering problem
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- Backtrack search algorithms and the maximal common subgraph problem
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Computing approximate tree edit distance using relaxation labeling
- Finding a Maximum Clique in an Arbitrary Graph
- GRASP: An annoted bibliography
- Generalized median graph computation by means of graph embedding in vector spaces
- Generalized median graphs and applications
- Greedy randomized adaptive search procedures
- Introduction to machine learning.
- Median graphs: A genetic approach based on new theoretical properties
- On the minimum common supergraph of two graphs
- Probability distribution of solution time in GRASP: an experimental investigation
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- TTT plots: a perl program to create time-to-target plots
- Topology of strings: median string is NP-complete
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
Cited in
(8)- On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
- Generalized median graph computation by means of graph embedding in vector spaces
- scientific article; zbMATH DE number 4128387 (Why is no real title available?)
- scientific article; zbMATH DE number 2090207 (Why is no real title available?)
- scientific article; zbMATH DE number 1691467 (Why is no real title available?)
- Generalized median graphs and applications
- scientific article; zbMATH DE number 2043370 (Why is no real title available?)
- A Recursive Embedding Approach to Median Graph Computation
This page was built for publication: Heuristics for the generalized median graph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323345)
