Cost and accuracy aware scientific workflow retrieval based on distance measure
From MaRDI portal
Publication:1749198
DOI10.1016/j.ins.2015.03.055zbMath1395.68214OpenAlexW2000158560MaRDI QIDQ1749198
Jun Wei, Yinglong Ma, Moyi Shi
Publication date: 16 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.03.055
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph similarity scoring and matching
- FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs
- A graph distance metric based on the maximal common subgraph
- Graph Classes: A Survey
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
This page was built for publication: Cost and accuracy aware scientific workflow retrieval based on distance measure