1162 search results - page 92 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
ALGORITHMICA
2006
13 years 8 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
TCS
2010
13 years 6 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—In this paper, two general algorithms for the automatic generation of instruction-set extensions are presented. The basic instruction set of a reconfigurable architectu...