Sciweavers

895 search results - page 31 / 179
» Using graphs for some discrete tomography problems
Sort
View
COMPGEOM
1995
ACM
14 years 2 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
ENDM
2008
93views more  ENDM 2008»
13 years 11 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 8 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
IAT
2008
IEEE
14 years 5 months ago
An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
Yiheng Xu, Qiangwei Wang, Jinglu Hu
COMPGEOM
2005
ACM
14 years 25 days ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...