Sciweavers

2398 search results - page 195 / 480
» Constraint Programming and Graph Algorithms
Sort
View
EMMCVPR
2007
Springer
16 years 18 days ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
ECOOP
2008
Springer
15 years 8 months ago
Inference of Reference Immutability
Abstract. Javari is an extension of Java that supports reference immutability constraints. Programmers write readonly type qualifiers and other constraints, and the Javari typechec...
Jaime Quinonez, Matthew S. Tschantz, Michael D. Er...
157
Voted
DM
2008
139views more  DM 2008»
15 years 6 months ago
On domination and reinforcement numbers in trees
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
COCOON
2010
Springer
15 years 5 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
CP
2007
Springer
16 years 18 days ago
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
Stéphane Zampelli, Yves Deville, Christine ...