Ovopub: Modular data publication with minimal provenance Alison Callahan1 and Michel Dumontier1,2,3 1 Department of Biology, 2Institute of Biochemistry, 3School of Computer Science,

Source URL: arxiv.org

• Computing
• Semantic Web
• Information science
• Data management
• Knowledge representation
• Resource Description Framework
• Named graph
• RDF Schema
• Web Ontology Language
• Triplestore
• Reification
• Provenance

The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN

Source URL: math.iit.edu

• Graph theory
• Mathematics
• Algebra
• Algebraic graph theory
• Matrices
• Matrix theory
• Adjacency matrix
• Line graph
• Graph
• Incidence matrix
• Regular graph
• Eigenvalues and eigenvectors

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Source URL: www.cse.iitk.ac.in

• Computational complexity theory
• Theory of computation
• Complexity classes
• Graph isomorphism problem
• NP
• PP
• Low
• Graph automorphism
• Hidden subgroup problem
• Time complexity
• P
• Chromatic polynomial

Under review for TGIS special issue FOSS4G2013 Towards an Open Source Analysis Toolbox for Street Network Comparison: Indicators, Tools and Results of a Comparison of OSM and the Official Austrian Reference Graph

Source URL: underdark.files.wordpress.com

• Discrete mathematics
• OpenStreetMap
• Mathematics
• Engineering
• Topology
• Pseudoforest
• Graph
• Geographic information system

155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver

Source URL: www.math.uiuc.edu

• Mathematics
• Graph theory
• Discrete mathematics
• Edsger W. Dijkstra
• Routing algorithms
• Operations research
• Network theory
• Shortest path problem
• Dynamic programming
• Distance
• Path
• Linear programming

Microsoft PowerPoint - Change in bird abundance graph

Source URL: hubbardbrookfoundation.org

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal

LNCSEfficient Dynamic Aggregation

Source URL: webee.technion.ac.il

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Minimum spanning tree
• Network flow
• Dynamic programming

GEOGRAPHIC INFORMATION SYSTEM DEVELOPMENTS WITHIN THE U.S. GEOLOGICAL SURVEY David A. Nystrom U.S. Geological Survey 521 National Center

Source URL: mapcontext.com

• Geographic information systems
• Cartography
• Data modeling
• Geography
• Geological surveys
• Archaeology
• Physical geography
• Data model
• United States Geological Survey
• Digital line graph
• Topography
• GIS applications

Shiping Liu Curriculum Vitae Personal Data Date of Birth: 21 July, 1984 Place of Birth: Shandong Province, China

Source URL: www.maths.dur.ac.uk

• Mathematics
• Graph theory
• Mathematical analysis
• Riemannian geometry
• Spectral graph theory
• Cheeger constant
• Spectral geometry
• Expander graph
• Karl-Theodor Sturm
• Spectral clustering
• Discrete geometry
• Graph