Sciweavers

1163 search results - page 48 / 233
» Embedding into Bipartite Graphs
Sort
View
WG
2001
Springer
14 years 12 days ago
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
Sergei L. Bezrukov, Robert Elsässer
ARSCOM
1998
79views more  ARSCOM 1998»
13 years 7 months ago
A characterization of halved cubes
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 9 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 9 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...
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick