Reachability Queries on Dynamic Temporal Bipartite Graphs
Abstract
References
Index Terms
- Reachability Queries on Dynamic Temporal Bipartite Graphs
Recommendations
A note on transformations of edge colorings of bipartite graphs
The author and A. Mirumian proved the following theorem: Let G be a bipartite graph with maximum degree @D and let t,n be integers, t>=n>=@D. Then it is possible to obtain, from one proper edge t-coloring of G, any proper edge n-coloring of G using only ...
Dominating induced matching in some subclasses of bipartite graphs
AbstractA subset M ⊆ E of edges of a graph G = ( V , E ) is called a matching if no two edges of M share a common vertex. An edge e ∈ E is said to dominate itself and all other edges adjacent to it. A matching M in a graph G = ( V , E ) is ...
Biclique Graphs of K3-free Graphs and Bipartite Graphs
AbstractA biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, was introduced and characterized in 2010 by Groshaus and Szwarcfiter. However, this ...
Comments
Information & Contributors
Information
Published In

- General Chairs:
- Maria Luisa Damiani,
- Matthias Renz,
- Program Chairs:
- Ahmed Eldawy,
- Peer Kröger,
- Mario A Nascimento
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 223Total Downloads
- Downloads (Last 12 months)206
- Downloads (Last 6 weeks)42
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in