Affiliation:
1. IST, Hokkaido University
2. National Institute of Informatics
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing
Reference24 articles.
1. [1] N. Alon, D. Reichman, I. Shinkar, T. Wagner, S. Musslick, J.D. Cohen, T. Griffiths, B. Dey, and K. Özcimder, “A graph-theoretic approach to multitasking,” Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, pp.2097-2106, Long Beach, CA, USA, Dec. 2017.
2. [2] H. Balakrishnan, C.L. Barrett, V.A. Kumar, M.V. Marathe, and S. Thite, “The distance-2 matching problem and its relationship to the mac-layer capacity of ad hoc wireless networks,” IEEE J. Sel. Areas Commun., vol.22, no.6, pp.1069-1079, 2004. 10.1109/jsac.2004.830909
3. [3] A. Brandstädt and C.T. Hoàng, “Maximum induced matchings for chordal graphs in linear time,” Algorithmica, vol.52, no.4, pp.440-447, 2008. 10.1007/s00453-007-9045-2
4. [4] K. Cameron, “Induced matchings,” Discrete Appl. Math., vol.24, no.1-3, pp.97-102, 1989. 10.1016/0166-218x(92)90275-f
5. [5] R. Curticapean and D. Marx, “Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts,” Proc. FOCS 2014, pp.130-139, IEEE, 2014. 10.1109/focs.2014.22
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献