Author:
Amilhastre Jérôme,Janssen Philippe,Vilarem Marie-Catherine
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. J. Amilhastre, M. C. Vilarem, and P. Janssen. Complexity of minimum biclique cover and decomposition for bipartite domino-free graphs. Discrete Applied Mathematics, 86(2):125–144, September 1998.
2. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C(35-6):677–691, 1986.
3. J. Daciuk, W. Watson, and B.W. Watson. Incremental construction of minimal acyclic finite state automata and transducers. In Finite State Methods in Natural Language Processing, Ankara, Turkey, 1998.
4. P.C. Fishburn and P.L. Hammer. Bipartite dimensions and bipartite degrees of graphs. Technical Report 76, DIMACS, June 1993. available at
http://dimacs.rutgers.edu/TechnicalReports
.
5. Tao Jiang and B. Ravikumar. Minimal NFA Problems are hard. SIAM Journal of Computation, 22:1117–1141, December 1993.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献