Maximal clique enumeration in finding near neighbourhoods

DOI10.1007/978-3-642-36505-8_7zbMATH Open1377.68305OpenAlexW67670335MaRDI QIDQ4909593FDOQ4909593

Authors: Christopher J. Henry, Sheela Ramanna 

Publication date: 21 March 2013

Published in: Transactions on Rough Sets XVI (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36505-8_7

Recommendations

• Parallel computation in finding near neighbourhoods
• A descriptive tolerance nearness measure for performing graph comparison
• Perception‐based image classification
• Neighbourhoods, classes and near sets
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs

zbMATH Keywords

tolerance relationtolerance spaceCBIRmaximal clique enumerationnearness measurepre-classnear setstolerance near sets

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computing methodologies for image processing (68U10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Topological spaces and generalizations (closure spaces, etc.) (54A05) Proximity structures and generalizations (54E05)

Cited In (6)

• Cliques with maximum/minimum edge neighborhood and neighborhood density
• Title not available (Why is that?)
• Variable neighborhood search for the maximum clique
• Parallel computation in finding near neighbourhoods
• Proximity Search for Maximal Subgraph Enumeration
• Metric free nearness measure using description-based neighbourhoods

This page was built for publication: Maximal clique enumeration in finding near neighbourhoods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909593)