731 search results - page 65 / 147 » Reductions to Graph Isomorphism |
143
click to vote
IJAC
2010
15 years 3 months ago
2010
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
180
click to vote
JCT
2010
15 years 4 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
180
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
142
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
160
click to vote
ISMVL
2010
IEEE
15 years 11 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...