Sciweavers

491 search results - page 46 / 99
» On cyclically orientable graphs
Sort
View
JCT
2008
120views more  JCT 2008»
14 years 12 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
EMMCVPR
2007
Springer
15 years 6 months 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
CCCG
2010
15 years 1 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein
NETWORKS
2006
14 years 12 months ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
FCT
2005
Springer
15 years 5 months ago
On Finding Acyclic Subhypergraphs
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
Kouichi Hirata, Megumi Kuwabara, Masateru Harao