Sciweavers

73 search results - page 2 / 15
» Projective-planar signed graphs and tangled signed graphs
Sort
View
TCS
2010
13 years 3 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
EJC
2011
13 years 6 days ago
Cubic time recognition of cocircuit graphs of uniform oriented matroids
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
Stefan Felsner, Ricardo Gómez Aiza, Kolja B...
DM
2007
100views more  DM 2007»
13 years 5 months ago
Decompositions of signed-graphic matroids
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
Daniel C. Slilaty, Hongxun Qin
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 6 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
ENDM
2002
134views more  ENDM 2002»
13 years 5 months ago
Bounds on the signed domination number of a graph
Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighbor...
Ruth Haas, Thomas B. Wexler