BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (49)
minimum (29)
algorithm (21)
graph (17)
time (11)

Stem span$ (all stems)

80 papers:

SIGMODSIGMOD-2015-HuangFL #graph
Minimum Spanning Trees in Temporal Graphs (SH, AWCF, RL), pp. 419–430.
BXBX-2015-JohnsonR #lens
Spans of Delta Lenses (MJ, RR), pp. 1–15.
BXBX-2015-JohnsonRa #monad
Distributing Commas, and the Monad of Anchored Spans (MJ, RR), pp. 31–42.
HTHT-2014-KoidlCW #independence #personalisation
Cross-site personalization: assisting users in addressing information needs that span independently hosted websites (KK, OC, VW), pp. 66–76.
CIAACIAA-2014-Fujiyoshi #automaton #multi #recognition
Recognition of Labeled Multidigraphs by Spanning Tree Automata (AF), pp. 188–199.
ICALPICALP-v2-2014-AschnerK #bound #constraints #modelling #network
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.
BXBX-2014-JohnsonR #lens
Spans of lenses (MJ, RDR), pp. 112–118.
ICALPICALP-v2-2013-HenzingerKN #maintenance #network
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
PPDPPPDP-2013-LamoMRL #approach #bidirectional #declarative #graph #model transformation
A declarative and bidirectional model transformation approach based on graph co-spans (YL, FM, AR, JdL), pp. 1–12.
SOSPSOSP-2013-WuBPKM #effectiveness #multi #named
SPANStore: cost-effective geo-replicated storage spanning multiple cloud services (ZW, MB, DP, EKB, HVM), pp. 292–308.
CASECASE-2012-FrankHEFDV #automation #modelling #realtime #requirements #using
Using contact points to integrate discipline spanning real-time requirements in modeling Networked Automation Systems for manufacturing systems (TF, TH, KE, AF, CD, BVH), pp. 851–856.
SIGMODSIGMOD-2012-ZhuLZZY #named #similarity
TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.
STOCSTOC-2012-AbrahamN #using
Using petal-decompositions to build a low stretch spanning tree (IA, ON), pp. 395–406.
STOCSTOC-2012-Belovs #source code
Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.
ICALPICALP-v1-2012-GeorgiadisT #independence #order
Dominators, Directed Bipolar Orders, and Independent Spanning Trees (LG, RET), pp. 375–386.
ICGTICGT-2012-Lowe #algebra #framework #graph grammar #graph transformation
Refined Graph Rewriting in Span-Categories — A Framework for Algebraic Graph Transformation (ML), pp. 111–125.
KDDKDD-2012-ChanLLBR #graph #mining #multi #named
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs (JC, WL, CL, JB, KR), pp. 651–659.
KDDKDD-2012-YinZC #algorithm #mining #named #performance
USpan: an efficient algorithm for mining high utility sequential patterns (JY, ZZ, LC), pp. 660–668.
PPoPPPPoPP-2012-NobariCKB #parallel #scalability
Scalable parallel minimum spanning forest computation (SN, TTC, PK, SB), pp. 205–214.
ICALPICALP-v1-2011-DingX #clustering #problem
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (HD, JX), pp. 773–784.
CIKMCIKM-2011-BykauMRV #evolution #query #using
Supporting queries spanning across phases of evolving artifacts using Steiner forests (SB, JM, FR, YV), pp. 1649–1658.
SACSAC-2011-KienHB #algorithm #communication #hybrid #problem #search-based
New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.
ICGTICGT-2010-Lowe #graph grammar
Graph Rewriting in Span-Categories (ML), pp. 218–233.
ICMLICML-2010-Cesa-BianchiGVZ #graph #predict #random
Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.
KDDKDD-2010-MarchRG #algorithm #analysis #performance
Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
SIGIRSIGIR-2010-SvoreKK #how #proximity #retrieval #web
How good is a span of terms?: exploiting proximity to improve web retrieval (KMS, PHK, NK), pp. 154–161.
SACSAC-2010-DolevT #distributed #named
Spanders: distributed spanning expanders (SD, NT), pp. 1309–1314.
CIAACIAA-2009-Fujiyoshi #automaton #graph #recognition
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.
HCIHCI-VAD-2009-KandoganHBM #collaboration #risk management
Studying Reactive, Risky, Complex, Long-Spanning, and Collaborative Work: The Case of IT Service Delivery (EK, EMH, JHB, PPM), pp. 504–513.
PPoPPPPoPP-2009-KangB #algorithm #graph #memory management #performance #transaction
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.
STOCSTOC-2008-FakcharoenpholL #algorithm #approximate #problem
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
STOCSTOC-2008-ReichardtS #algorithm #quantum
Span-program-based quantum algorithm for evaluating formulas (BR, RS), pp. 103–112.
STOCSTOC-2007-SinghL #approximate #bound
Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
ICALPICALP-2007-BergerG #graph
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (AB, MG), pp. 90–101.
CIKMCIKM-2006-XuWFSP #classification #correlation #data type
Classification spanning correlated data streams (YX, KW, AWCF, RS, JP), pp. 132–141.
ICPRICPR-v3-2006-QiuH #graph #using
Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.
ICPRICPR-v4-2006-QiuH06a #graph #using
Graph Matching using Commute Time Spanning Tr (HQ, ERH), p. 955.
ICDARICDAR-2005-LongDC #detection #documentation
A Model for Detecting and Merging Vertically Spanned Table Cells in Plain Text Documents (VL, RD, SC), pp. 1242–1246.
STOCSTOC-2005-ElkinEST
Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.
ICMLICML-2005-PoczosL #analysis #independence #using
Independent subspace analysis using geodesic spanning trees (BP, AL), pp. 673–680.
STOCSTOC-2004-CzumajS #metric
Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.
STOCSTOC-2004-Elkin #approximate #bound #distributed #problem #trade-off
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
ICALPICALP-2004-JothiR #algorithm #approximate #design #network #problem
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
KDDKDD-2004-ChengYH #database #incremental #mining #named #scalability
IncSpan: incremental mining of sequential patterns in large database (HC, XY, JH), pp. 527–532.
SACSAC-2004-RahmaniK #graph #strict
Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.
ICALPICALP-2003-GarganoH #graph #how
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them) (LG, MH), pp. 802–816.
SACSAC-2003-HareJ #algorithm #problem #search-based
A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
SACSAC-2003-RaidlJ #algorithm #bound #heuristic #problem
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
ICALPICALP-2002-GarganoHSV #bound #branch
Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.
ICPRICPR-v4-2002-JainXHX #testing #using
Uniformity Testing Using Minimal Spanning Tree (AKJ, XX, TKH, FX), pp. 281–284.
SACSAC-2002-JulstromR #algorithm #robust #set
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
ICALPICALP-2001-ChazelleRT #approximate #sublinear
Approximating the Minimum Spanning Tree Weight in Sublinear Time (BC, RR, LT), pp. 190–200.
STOCSTOC-2000-KonemannR #algorithm #approximate #bound #matter
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
ICALPICALP-2000-PettieR #algorithm
An Optimal Minimum Spanning Tree Algorithm (SP, VR), pp. 49–60.
KDDKDD-2000-HanPMCDH #mining #named
FreeSpan: frequent pattern-projected sequential pattern mining (JH, JP, BMA, QC, UD, MH), pp. 355–359.
SACSAC-2000-RaidlJ #algorithm #problem #search-based
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
DATEDATE-1999-NoethK #encoding #power management
Spanning Tree-based State Encoding for Low Power Dissipation (WN, RK), pp. 168–174.
STOCSTOC-1998-Gal #bound #source code
A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.
STOCSTOC-1998-HolmLT #algorithm
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
ICALPICALP-1998-Peleg #distributed
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.
ICALPICALP-1998-PelegR #approximate #communication
Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.
ICALPICALP-1997-HenzingerK #graph #maintenance
Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
ICALPICALP-1997-KrumkeMNRRSW
Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.
STOCSTOC-1996-BabaiGKRSW #bound #graph #source code
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.
STOCSTOC-1996-Wilson #generative #random
Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.
ICPRICPR-1996-Marchand-MailletS #analysis #approach #image
A minimum spanning tree approach to line image analysis (SMM, YMS), pp. 225–230.
SACSAC-1995-AbualiWS #encoding #graph #representation
Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs (FNA, RLW, DAS), pp. 305–312.
HPDCHPDC-1995-JacobL #algorithm #performance #recursion #refinement
A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
STOCSTOC-1994-GargH #algorithm #approximate #problem
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
STOCSTOC-1994-KhullerRY
Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.
STOCSTOC-1994-KleinT #algorithm #linear #random
A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
ICALPICALP-1994-ItalianoR #maintenance
Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.
SACSAC-1994-AbualiSW #algorithm #design #network #probability #search-based #using
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.
DACDAC-1987-GranackiP #interface #named #natural language #specification
PHRAN-SPAN: A Natural Language Interface for System Specifications (JJGJ, ACP), pp. 416–422.
STOCSTOC-1987-Awerbuch #algorithm #distributed #problem #summary
Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.
ICALPICALP-1986-VarmanD #algorithm #parallel
A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.
STOCSTOC-1984-Clarkson #algorithm #approximate #geometry #performance
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.
STOCSTOC-1984-Post
Minimum Spanning Ellipsoids (MJP), pp. 108–116.
STOCSTOC-1983-Frederickson #data type #online
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) (GNF), pp. 252–257.
ICALPICALP-1979-PapadimitriouY #complexity #problem #strict
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.