Bisimplicial Edges in Bipartite Graphs
نویسندگان
چکیده
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to find such edges in bipartite graphs. The expected time complexity of our new algorithm is O ( n2 log n ) on random bipartite graphs in which each edge is present with a fixed probability p, a polynomial improvement over the fastest algorithm found in the existing literature.
منابع مشابه
On Right-angled Artin Groups without Surface Subgroups
We study the class N of graphs, the right-angled Artin groups defined on which do not contain surface subgroups. We prove that a presumably smaller class N ′ is closed under amalgamating along complete subgraphs, and also under adding bisimplicial edges. It follows that chordal graphs and chordal bipartite graphs belong to N ′.
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملDisimplicial arcs, transitive vertices, and disimplicial eliminations
In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A diclique of a digraph is a pair V → W of sets of vertices such that v → w is an arc for every v ∈ V and w ∈W . An arc v → w is disimplicial when N−(w)→ N(v) is a diclique. We show that the problem of finding the disimplicial arcs is...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 161 شماره
صفحات -
تاریخ انتشار 2010