Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs
Abstract
Supplementary Material
- Download
- 30.86 MB
References
Index Terms
- Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs
Recommendations
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
A set D ⊆ V of a graph G =( V , E ) is a dominating set of G if every vertex in V D has at least one neighbor in D . A dominating set D of G is a paired-dominating set of G if the induced subgraph, G [ D ], has a perfect ...
Edge-deletable IM-extendable graphs with minimum number of edges
A graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. For a nonnegative integer k, a graph G is called a k-edge-deletable IM-extendable graph, if, for every F@?E(G) with |...
Hamiltonian claw-free graphs involving minimum degrees
Favaron and Fraisse proved that any 3-connected claw-free graph H with order n and minimum degree @d(H)>=n+3810 is hamiltonian [O. Favaron and P. Fraisse, Hamiltonicity and minimum degree in 3-connected claw-free graphs, J. Combin. Theory B 82 (2001) ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 135Total Downloads
- Downloads (Last 12 months)41
- Downloads (Last 6 weeks)4
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in