Graph Characterization and Sampling Algorithms.
Abstract
Abstract not provided.
 Authors:
 (UC Santa Cruz)
 Publication Date:
 Research Org.:
 Sandia National Lab. (SNLCA), Livermore, CA (United States)
 Sponsoring Org.:
 USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC21)
 OSTI Identifier:
 1249461
 Report Number(s):
 SAND20153266PE
583474
 DOE Contract Number:
 AC0494AL85000
 Resource Type:
 Conference
 Resource Relation:
 Conference: Proposed for presentation at the Computer Information Science (CIS) Review held April 2123, 2015 in Albuquerque, NM.
 Country of Publication:
 United States
 Language:
 English
Citation Formats
Kolda, Tamara G., Pinar, Ali, and Comandur, Seshadhri. Graph Characterization and Sampling Algorithms.. United States: N. p., 2015.
Web.
Kolda, Tamara G., Pinar, Ali, & Comandur, Seshadhri. Graph Characterization and Sampling Algorithms.. United States.
Kolda, Tamara G., Pinar, Ali, and Comandur, Seshadhri. 2015.
"Graph Characterization and Sampling Algorithms.". United States.
doi:. https://www.osti.gov/servlets/purl/1249461.
@article{osti_1249461,
title = {Graph Characterization and Sampling Algorithms.},
author = {Kolda, Tamara G. and Pinar, Ali and Comandur, Seshadhri},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2015,
month = 4
}
Other availability
Please see Document Availability for additional information on obtaining the fulltext document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.


Efficient multipleway graph partitioning algorithms
Graph partitioning deals with evenly dividing a graph into two or more parts such that the total weight of edges interconnecting these parts, i.e., cutsize, is minimized. Graph partitioning has important applications in VLSI layout, mapping, and sparse Gaussian elimination. Since graph partitioning problem is NPhard, we should resort to polynomialtime algorithms to obtain a good solution, or hopefully a nearoptimal solution. KernighanLin (KL) propsoed a 2way partitioning algorithms. FiducciaMattheyses (FM) introduced a faster version of KL algorithm. Sanchis (FMS) generalized FM algorithm to a multipleway partitioning algorithm. Simulated Annealing (SA) is one of the most successful approaches that aremore » 
An empirical study of dynamic graph algorithms
We conduct an empirical study on some dynamic graph algorithms which where developed recently. The following implementations were tested and compared with simple algorithms: dynamic connectivity, and dynamic minimum 1 spanning tree based on sparsification by Eppstein et al.; dynamic connectivity based on a very recent paper by Henzinger and King. In our experiments, we considered both random and nonrandom inputs. Moreover, we present a simplified variant of the algorithm by Henzinger and King, which for random inputs was always faster than the original implementation. Indeed, this variant was among the fastest implementations for random inputs. For nonrandom inputs, sparsificationmore » 
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
We present the first randomized O(log n) time and O(m + n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V, E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as finding a bipartite partition, finding bridges and biconnected components, and finding Euler tours in Eulerean graphs. For other problems such as finding an ear decomposition, finding an open ear decomposition, finding a strong orientation, and finding anmore » 
Utilizing knowledgebase semantics in graphbased algorithms
Graphbased algorithms convert a knowledge base with a graph structure into one with a tree structure (a jointree) and then apply treeinference on the result. Nodes in the jointree are cliques of variables and treeinference is exponential in w*, the size of the maximal clique in the jointree. A central property of jointrees that validates treeinference is the runningintersection property: the intersection of any two cliques must belong to every clique on the path between them. We present two key results in connection to graphbased algorithms. First, we show that the runningintersection property, although sufficient, is not necessary for validatingmore »