Dominating Sets and Induced Matchings in Orthogonal Ray Graphs-Reference-Cited by-同舟云学术

Dominating Sets and Induced Matchings in Orthogonal Ray Graphs

Published:2014 Issue:12 Volume:E97.D Page:3101-3109
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

TAKAOKA Asahi¹,TAYU Satoshi¹,UENO Shuichi¹

Affiliation:

1. Department of Communications and Computer Engineering, Tokyo Institute of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E97.D/12/E97.D_2014EDP7184/_pdf

Reference58 articles.

1. [1] A. Abueida, A.H. Busch, and R. Sritharan, “A min-max property of chordal bipartite graphs with applications,” Graphs and Combinatorics, vol.26, pp.301-313, 2010.

2. [2] H. Balakrishnan, C. Barrett, V. Kumar, M. Marathe, and S. Thite, “The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks,” IEEE J. Selected Areas Commun., vol.22, pp.1069-1079, 2004.

3. [3] C.L. Barrett, V.S.A. Kumar, M.V. Marathe, S. Thite, and G. Istrate, “Strong edge coloring for channel assignment in wireless radio networks,” Proceedings of the 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, pp.106-110, 2006.

4. [4] R. Belmonte and M. Vatshelle, “Graph classes with structured neighborhoods and algorithmic applications,” Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.6986, pp.47-58, 2011.

5. [5] R. Belmonte and M. Vatshelle, “Graph classes with structured neighborhoods and algorithmic applications,” Theoretical Computer Science, vol.511, pp.54-65, 2013.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decomposition of <i>P</i><sub>6</sub>-Free Chordal Bipartite Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-11-01

2. Graph classes equivalent to 12-representable graphs;Discussiones Mathematicae Graph Theory;2023

3. Dominating Sets in Two-Directional Orthogonal Ray Graphs;IEICE Transactions on Information and Systems;2015

4. Graph Isomorphism Completeness for Trapezoid Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2015