Results 51 to 60 of about 2,283,531 (215)

Special Issue on Graph Algorithms

open access: yesAlgorithms, 2013
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj   +1 more source

Graph algorithms on GPUs

open access: yes, 2017
This chapter introduces the topic of graph algorithms on GPUs. It starts by presenting and comparing the main important data structures and techniques applied for representing and analysing graphs on GPUs at the state of the art.It then presents the theory and an updated review of the most efficient implementations of graph algorithms for GPUs.
BUSATO, FEDERICO, BOMBIERI, Nicola
openaire   +2 more sources

Algorithms for Perfectly Contractile Graphs [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2005
We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole of length at least 5, and no prism (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class ${\cal A}'$ of graphs that contain no odd hole, no antihole of length at least 5, and no odd prism (prism whose three paths are odd ...
Maffray, Frédéric, Trotignon, Nicolas
openaire   +6 more sources

Heuristic Search for the Analysis of Graph Transition Systems [PDF]

open access: yes, 2006
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto   +5 more
core   +1 more source

Outlier edge detection using random graph generation models and applications

open access: yesJournal of Big Data, 2017
Outliers are samples that are generated by different mechanisms from other normal data samples. Graphs, in particular social network graphs, may contain nodes and edges that are made by scammers, malicious programs or mistakenly by normal users ...
Honglei Zhang   +2 more
doaj   +1 more source

Graph Reachability on Parallel Many-Core Architectures

open access: yesComputation, 2020
Many modern applications are modeled using graphs of some kind. Given a graph, reachability, that is, discovering whether there is a path between two given nodes, is a fundamental problem as well as one of the most important steps of many other ...
Stefano Quer, Andrea Calabrese
doaj   +1 more source

Graph Pattern Matching: From Intractable to Polynomial Time [PDF]

open access: yes, 2010
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong   +5 more
core  

Visualizing Interdomain Routing with BGPlay [PDF]

open access: yes, 2005
In this paper we describe the architecture and the visual interface of BGPlay, an on-line service for the visualization of the behavior and of the instabilities of Internet routing at the autonomous system level.
Maurizio Pizzonia   +7 more
core   +1 more source

An algorithmic analysis of Flood-It and Free-Flood-It on graph powers [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Analysis of ...
Uéverton dos Santos Souza   +2 more
doaj   +1 more source

Graph-based discovery of ontology change patterns [PDF]

open access: yes, 2011
Ontologies can support a variety of purposes, ranging from capturing conceptual knowledge to the organisation of digital content and information. However, information systems are always subject to change and ontology change management can pose challenges.
Abgaz, Yalemisew   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy