Sciweavers

1883 search results - page 25 / 377
» Ordered theta graphs
Sort
View
JEA
2008
88views more  JEA 2008»
13 years 7 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
ICCS
2007
Springer
14 years 1 months ago
Constants and Functions in Peirce's Existential Graphs
The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precisely: As Peirce wanted to develop a logic of relatives (i.e., relations...
Frithjof Dau
CAV
2008
Springer
143views Hardware» more  CAV 2008»
13 years 9 months ago
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
Salil Joshi, Barbara König
DM
2008
62views more  DM 2008»
13 years 7 months ago
Classification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
Jan Degraer, Kris Coolsaet
IJON
2010
94views more  IJON 2010»
13 years 6 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix