The following pages link to (Q4808935):
Displaying 9 items.
- Heuristics for the generalized median graph problem (Q323345) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
- Median graphs: A genetic approach based on new theoretical properties (Q2270833) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- (Q5005670) (← links)
- Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices (Q5054534) (← links)