779 search results - page 33 / 156 » A graph polynomial for independent sets of bipartite graphs |
152
click to vote
DATE
2007
IEEE
16 years 14 days ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
145
click to vote
JCT
2007
15 years 6 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
152
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
164
click to vote
HICSS
2008
IEEE
16 years 17 days ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
166
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...