On the minimum weight bounded length circuit cover problem on grid graphs

Research output: Working paper

Abstract

This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.
Original languageEnglish
Publication statusUnpublished - 2013

Fingerprint

Networks (circuits)

Keywords

  • minimum weight
  • bounded length
  • circuit cover problem
  • grid graphs

Cite this

@techreport{b27d805dddd84732bf27167511128a4b,
title = "On the minimum weight bounded length circuit cover problem on grid graphs",
abstract = "This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.",
keywords = "minimum weight, bounded length , circuit cover problem, grid graphs",
author = "Erzsebet Dombi",
year = "2013",
language = "English",
type = "WorkingPaper",

}

TY - UNPB

T1 - On the minimum weight bounded length circuit cover problem on grid graphs

AU - Dombi, Erzsebet

PY - 2013

Y1 - 2013

N2 - This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.

AB - This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.

KW - minimum weight

KW - bounded length

KW - circuit cover problem

KW - grid graphs

M3 - Working paper

BT - On the minimum weight bounded length circuit cover problem on grid graphs

ER -