Sciweavers

5889 search results - page 205 / 1178
» Graph Layout Problems
Sort
View
STACS
2005
Springer
15 years 12 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Telikepalli Kavitha, Kurt Mehlhorn
DAM
1999
119views more  DAM 1999»
15 years 6 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
SIGGRAPH
1995
ACM
15 years 10 months ago
Interactive physically-based manipulation of discrete/continuous models
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...
Mikako Harada, Andrew P. Witkin, David Baraff
232
Voted
ICALP
1995
Springer
15 years 10 months ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
164
Voted
LCTRTS
2007
Springer
16 years 17 days ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue