Sciweavers

5607 search results - page 303 / 1122
» Graph structure in the Web
Sort
View
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 8 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
OPODIS
2008
15 years 8 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
DM
2007
103views more  DM 2007»
15 years 6 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
SIMULATION
2008
139views more  SIMULATION 2008»
15 years 6 months ago
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
Pieter J. L. Cuijpers, Jan F. Broenink, Pieter J. ...
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 5 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou