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:
graph (15)
space (6)
time (6)
connect (6)
flow (6)

Stem undirect$ (all stems)

28 papers:

ICALPICALP-v1-2015-DoronT #approximate #graph #on the #probability #problem
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (DD, ATS), pp. 419–431.
KDDKDD-2015-Shun #algorithm #estimation #evaluation #graph #parallel
An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs (JS), pp. 1095–1104.
ICALPICALP-v1-2014-BaswanaK #algorithm #graph #incremental #maintenance
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (SB, SK), pp. 138–149.
STOCSTOC-2012-Chuzhoy12a #constant #graph
Routing in undirected graphs with constant congestion (JC), pp. 855–874.
KDDKDD-2012-YangYLSWY #graph
Feature grouping and selection over an undirected graph (SY, LY, YCL, XS, PW, JY), pp. 922–930.
STOCSTOC-2011-ChristianoKMST #approximate #graph #performance
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
STOCSTOC-2011-ItalianoNSW #algorithm #graph
Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.
STOCSTOC-2010-Vegh
Augmenting undirected node-connectivity by one (LAV), pp. 563–572.
ICPRICPR-2010-IgelmoSF #graph #representation
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs (MI, AS, MF), pp. 958–961.
ICPRICPR-2010-RichiardiVRB #classification #graph #sequence
Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification (JR, DVDV, KR, HB), pp. 902–905.
ICALPICALP-v2-2009-CooperIKK #graph #random #using
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.
ICMLICML-2009-RoyLW #consistency #learning #modelling #probability #visual notation
Learning structurally consistent undirected probabilistic graphical models (SR, TL, MWW), pp. 905–912.
LICSLICS-2009-HofmannS #pointer #reachability #source code
Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
ICALPICALP-v1-2006-FiatKLOS #design #network #on the
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (AF, HK, ML, SO, RS), pp. 608–618.
STOCSTOC-2005-AndrewsZ #problem
Hardness of the undirected edge-disjoint paths problem (MA, LZ), pp. 276–283.
STOCSTOC-2005-AndrewsZ05a #problem
Hardness of the undirected congestion minimization problem (MA, LZ), pp. 284–293.
STOCSTOC-2005-Reingold
Undirected ST-connectivity in log-space (OR), pp. 376–385.
STOCSTOC-2005-Trifonov #algorithm
An O(log n log log n) space algorithm for undirected st-connectivity (VT), pp. 626–633.
STOCSTOC-1998-KargerL #graph
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
STOCSTOC-1997-Karger #graph #random #using
Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.
STOCSTOC-1996-NagamochiI #graph
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs (HN, TI), pp. 64–73.
STOCSTOC-1994-Cohen #approximate
Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.
STOCSTOC-1993-Edmonds #trade-off
Time-space trade-offs for undirected st-connectivity on a JAG (JE), pp. 718–727.
STOCSTOC-1991-BarnesR #algorithm #polynomial #sublinear #using
Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) (GB, WLR), pp. 43–53.
STOCSTOC-1989-BroderKRU
Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.
STOCSTOC-1985-SuzukiNS #graph #multi
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.
ICALPICALP-1983-HambruschS #bound #graph #problem
Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.
ICALPICALP-1981-Reif #network
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.

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.