Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Computationally efficient sup-t transitive closure for spars...
Sort
relevance
views
votes
recent
update
View
thumb
title
69
Voted
FSS
2006
81
views
more
FSS 2006
»
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
15 years 2 months ago
Download
www.image.ntua.gr
Manolis Wallace, Yannis S. Avrithis, Stefanos D. K...
claim paper
Read More »
111
Voted
APPROX
2010
Springer
168
views
Algorithms
»
more
APPROX 2010
»
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
15 years 4 months ago
Download
www.cse.psu.edu
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »