TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph

Summary: TF-label proposes a topological folding labeling scheme for reachability in large graphs; folds the graph in half to shrink labels. Efficient construction and optimization; scalable index-building yield faster reachability queries than state-of-the-art methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4695
Venue: SIGMOD
Year: 2013
Pagerank: 0.00010226347
Overall Rank: 1,880 | 86.93%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 20 of 20 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,024	Path Problems in Temporal Graphs	2014	VLDB	0.00014609643
1,394	Real-time Constrained Cycle Detection in Large Dynamic Graphs	2018	VLDB	0.0001221552
1,777	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.00010589591
2,927	Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees	2014	VLDB	7.8823626e-05
3,146	Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs	2022	VLDB	7.477231e-05
3,213	Landmark Indexing for Evaluation of Label-Constrained Reachability Queries	2017	SIGMOD	7.3669794e-05
3,671	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB	6.8560247e-05
4,478	Reachability Querying: An Independent Permutation Labeling Approach	2014	VLDB	6.1506256e-05
4,836	Making Graphs Compact by Lossless Contraction	2021	SIGMOD	5.8896897e-05
5,479	Microblog Entity Linking with Social Temporal Context	2015	SIGMOD	5.4850984e-05
6,657	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD	4.9720132e-05
6,795	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9242446e-05
7,596	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.7016964e-05
7,716	Minimum Strongly Connected Subgraph Collection in Dynamic Graphs	2024	VLDB	4.6696364e-05
8,668	Towards Generating Hop-constrained s-t Simple Path Graphs	2023	SIGMOD	4.4718257e-05
9,042	HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs	2023	SIGMOD	4.4039656e-05
9,483	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3341665e-05
9,898	Top-k Relevant Semantic Place Retrieval on Spatial RDF Data	2016	SIGMOD	4.2600049e-05
10,985	Constant-time Connectivity Querying in Dynamic Graphs	2024	SIGMOD	4.1945683e-05
11,191	Parallel Strong Connectivity Based on Faster Reachability	2023	SIGMOD	4.1945683e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
246	Efficient Management of Transitive Relationships in Large Data and Knowledge Bases	1989	SIGMOD	0.00030949575
279	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029113513
334	Fast and Practical Indexing and Querying of Very Large Graphs	2007	SIGMOD	0.00027081079
425	Stack-based Algorithms for Pattern Matching on DAGs	2005	VLDB	0.00023598882
686	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00018178029
733	GRAIL: Scalable Reachability Index for Large Graphs	2010	VLDB	0.00017460741
1,553	A Memory Efficient Reachability Data Structure Through Bit Vector Compression	2011	SIGMOD	0.00011402871
1,838	IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying	2013	VLDB	0.00010349881
2,756	K-Reach: Who is in Your Small World	2012	VLDB	8.1682536e-05
3,127	SCARAB: Scaling Reachability Computation on Large Graphs	2012	SIGMOD	7.5046522e-05
4,067	Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach	2012	SIGMOD	6.4795399e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,838	IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying	2013	VLDB	0.00010349881
1,823	Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks	2014	VLDB	0.00010413508
6,795	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9242446e-05
7,428	DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs	2022	VLDB	4.7320892e-05
1,777	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.00010589591
9,483	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3341665e-05
4,478	Reachability Querying: An Independent Permutation Labeling Approach	2014	VLDB	6.1506256e-05
3,671	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB	6.8560247e-05
2,957	Computing Label-Constraint Reachability in Graph Databases	2010	SIGMOD	7.8198686e-05
788	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016650034