3008 search results - page 76 / 602 » Independence in connected graphs |
153
click to vote
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to e than the edge ideal metric family defi...
180
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
154
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
160
click to vote
IPL
2010
15 years 4 months ago
2010
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
181
click to vote
ASWEC
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a novel methodology for analysing change propagation in software using the domain-level behavioural model of a system. We hypothesize that change propagation analysis i...