IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2022-03-06 16:00
Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming
Yu Nakahata (NAIST) COMP2021-36
Abstract (in Japanese) (See Japanese page) 
(in English) Enumeration of constrained graphs is important for both graph-theoretical study and testcase generation. We propose a method to enumerate constrained labeled graphs using answer set programming (ASP). ASP is a kind of declarative programming, and we can enumerate solutions by writing the definition of the solutions. We propose several encodings for subclasses of perfect graphs: chordal, split, and threshold graphs. We compare the efficiency of the encodings by experiment.
Keyword (in Japanese) (See Japanese page) 
(in English) Graph / Perfect graph / Enumeration / Answer Set Programming / / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 407, COMP2021-36, pp. 26-30, March 2022.
Paper # COMP2021-36 
Date of Issue 2022-02-27 (COMP) 
ISSN Online edition: ISSN 2432-6380
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2021-36

Conference Information
Committee COMP  
Conference Date 2022-03-06 - 2022-03-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2022-03-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming 
Sub Title (in English)  
Keyword(1) Graph  
Keyword(2) Perfect graph  
Keyword(3) Enumeration  
Keyword(4) Answer Set Programming  
1st Author's Name Yu Nakahata  
1st Author's Affiliation Nara Institute of Science and Technology (NAIST)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2022-03-06 16:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2021-36 
Volume (vol) vol.121 
Number (no) no.407 
Page pp.26-30 
Date of Issue 2022-02-27 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan