Sciweavers

KES
2008
Springer
13 years 3 months ago
Visual Analysis Tool for Bipartite Networks
Abstract. To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called "anchor...
Kazuo Misue
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 3 months ago
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Suhan Choi, S. Sandeep Pradhan
ENDM
2010
100views more  ENDM 2010»
13 years 3 months ago
Balanced list edge-colourings of bipartite graphs
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
Tamás Fleiner, András Frank
DAM
2008
123views more  DAM 2008»
13 years 3 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 3 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 3 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
IPCO
1998
125views Optimization» more  IPCO 1998»
13 years 5 months ago
A Characterization of Weakly Bipartite Graphs
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
Bertrand Guenin
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 5 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
IPMU
2010
Springer
13 years 5 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 5 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan