73 search results - page 3 / 15 » Projective-planar signed graphs and tangled signed graphs |
JCO
2010
13 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
DM
2006
13 years 5 months ago
2006
This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unl...
DM
2010
13 years 5 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
WWW
2005
ACM
14 years 6 months ago
2005
ACM
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
WEA
2007
Springer
13 years 12 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...