Sciweavers

966 search results - page 92 / 194
» Small Alliances in Graphs
Sort
View
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 11 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
FSTTCS
2008
Springer
13 years 11 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
BMCBI
2008
116views more  BMCBI 2008»
13 years 10 months ago
A novel representation of RNA secondary structure based on element-contact graphs
Background: Depending on their specific structures, noncoding RNAs (ncRNAs) play important roles in many biological processes. Interest in developing new topological indices based...
Wenjie Shu, Xiaochen Bo, Zhiqiang Zheng, Shengqi W...
ORDER
2006
97views more  ORDER 2006»
13 years 10 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood