1149 search results - page 50 / 230 » Minimally non-Pfaffian graphs |
DAM
2010
14 years 9 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
ICCAD
1993
IEEE
15 years 4 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
102
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
116
click to vote
ASPDAC
1999
ACM
15 years 4 months ago
1999
ACM
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...