Vertex Coloring of a Graph for Memory Constrained Scenarios
Sign Up to like & getrecommendations! Published in 2020 at "Mathematics in Computer Science"
DOI: 10.1007/s11786-019-00409-4
Abstract: Given an undirected graph $$G=(V,E)$$ G = ( V , E ) , where V is a set of n vertices and E is a set of m edges, the vertex coloring problem consists in… read more here.
Keywords: constrained scenarios; graph memory; coloring graph; vertex coloring ... See more keywords
Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2025.3599898
Abstract: Graph data in real-world scenarios undergo rapid and frequent changes, making it challenging for existing graph models to effectively handle the continuous influx of new data and accommodate data withdrawal requests. The approach to frequently… read more here.
Keywords: brain; memory; graph memory; mechanism ... See more keywords