Database Paper Browser

Back to papers

Repairing Vertex Labels under Neighborhood Constraints

Summary: Repairing Vertex Labels under Neighborhood Constraints studies cleaning vertex labels to satisfy allowed adjacent-label pairs in graphs. Facing NP-hard relabeling, it proposes greedy, contraction, and hybrid approximations, analyzes star/clique cases, and shows strong empirical performance on synthetic and real networks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10978
Venue
VLDB
Year
2014
Pagerank
5.3007132e-05
Overall Rank
5,852 | 59.29%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers