Sciweavers

2283 search results - page 154 / 457
» Bounds of Graph Characteristics
Sort
View
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 5 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
FMCAD
2007
Springer
14 years 2 months ago
Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs
Abstract— The relationship between changes in gene expression and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with...
Neha Rungta, Hyrum Carroll, Eric G. Mercer, Randal...
AINA
2010
IEEE
14 years 29 days ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
ECCC
2006
70views more  ECCC 2006»
13 years 8 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
DAM
2006
47views more  DAM 2006»
13 years 8 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian