Sciweavers

866 search results - page 83 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
DCC
2008
IEEE
14 years 9 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
CORR
2007
Springer
118views Education» more  CORR 2007»
13 years 9 months ago
Contains and Inside relationships within combinatorial Pyramids
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
Luc Brun, Walter G. Kropatsch
EVOW
2004
Springer
14 years 2 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
GD
2009
Springer
14 years 1 months ago
Upward Planarization Layout
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
CC
2006
Springer
132views System Software» more  CC 2006»
14 years 1 months ago
Register Allocation for Programs in SSA-Form
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
Sebastian Hack, Daniel Grund, Gerhard Goos