id	sid	tid	token	lemma	pos
cana-3401	1	1	communications	communication	NOUN
cana-3401	1	2	on	on	ADP
cana-3401	1	3	applied	apply	VERB
cana-3401	1	4	nonlinear	nonlinear	ADJ
cana-3401	1	5	analysis	analysis	NOUN
cana-3401	1	6	issn	issn	NOUN
cana-3401	1	7	:	:	PUNCT
cana-3401	1	8	1074	1074	NUM
cana-3401	1	9	-	-	PUNCT
cana-3401	1	10	133x	133x	NUM
cana-3401	1	11	vol	vol	NOUN
cana-3401	1	12	32	32	NUM
cana-3401	1	13	no	no	NOUN
cana-3401	1	14	.	.	PUNCT
cana-3401	2	1	7s	7	NOUN
cana-3401	2	2	(	(	PUNCT
cana-3401	2	3	2025	2025	NUM
cana-3401	2	4	)	)	PUNCT
cana-3401	2	5	296	296	NUM
cana-3401	2	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	2	7	fast	fast	ADJ
cana-3401	2	8	generation	generation	NOUN
cana-3401	2	9	of	of	ADP
cana-3401	2	10	k	k	ADJ
cana-3401	2	11	-	-	ADJ
cana-3401	2	12	secluded	secluded	ADJ
cana-3401	2	13	vertex	vertex	NOUN
cana-3401	2	14	sets	set	NOUN
cana-3401	2	15	for	for	ADP
cana-3401	2	16	fuzzy	fuzzy	ADJ
cana-3401	2	17	graph	graph	NOUN
cana-3401	2	18	partitioning	partition	VERB
cana-3401	2	19	subject	subject	NOUN
cana-3401	2	20	to	to	ADP
cana-3401	2	21	forbidden	forbid	VERB
cana-3401	2	22	induced	induced	ADJ
cana-3401	2	23	subgraphs	subgraphs	PROPN
cana-3401	2	24	dr	dr	PROPN
cana-3401	2	25	.	.	PROPN
cana-3401	2	26	v.	v.	PROPN
cana-3401	2	27	vijayalakshmi1	vijayalakshmi1	PROPN
cana-3401	2	28	,	,	PUNCT
cana-3401	2	29	dr	dr	PROPN
cana-3401	2	30	.	.	PROPN
cana-3401	2	31	d.	d.	PROPN
cana-3401	2	32	sridevi1	sridevi1	PROPN
cana-3401	2	33	*	*	PROPN
cana-3401	2	34	,	,	PUNCT
cana-3401	2	35	dr	dr	PROPN
cana-3401	2	36	.	.	PROPN
cana-3401	2	37	r.prema	r.prema	PROPN
cana-3401	2	38	sumathi2	sumathi2	PROPN
cana-3401	2	39	,	,	PUNCT
cana-3401	2	40	dr.k	dr.k	ADV
cana-3401	2	41	.	.	PUNCT
cana-3401	3	1	iyappan3	iyappan3	NOUN
cana-3401	3	2	,	,	PUNCT
cana-3401	3	3	m.h.a	m.h.a	PROPN
cana-3401	3	4	.	.	PUNCT
cana-3401	3	5	aysha	aysha	PROPN
cana-3401	3	6	chithukka4	chithukka4	PROPN
cana-3401	3	7	1vijayalakshmiv.maths@srmvalliammai.ac.in,1*sridevid.it@srmvalliammai.ac.in,2premasumathisas@gmail.com	1vijayalakshmiv.maths@srmvalliammai.ac.in,1*sridevid.it@srmvalliammai.ac.in,2premasumathisas@gmail.com	PROPN
cana-3401	3	8	,	,	PUNCT
cana-3401	3	9	3drkiyappan@gmail.com	3drkiyappan@gmail.com	PROPN
cana-3401	3	10	,	,	PUNCT
cana-3401	3	11	4	4	NUM
cana-3401	3	12	aysha.maths@srmvalliammai.ac.in	aysha.maths@srmvalliammai.ac.in	SYM
cana-3401	3	13	1associate	1associate	NUM
cana-3401	3	14	professor	professor	NOUN
cana-3401	3	15	,	,	PUNCT
cana-3401	3	16	department	department	NOUN
cana-3401	3	17	of	of	ADP
cana-3401	3	18	mathematics	mathematic	NOUN
cana-3401	3	19	,	,	PUNCT
cana-3401	3	20	srm	srm	PROPN
cana-3401	3	21	valliammai	valliammai	PROPN
cana-3401	3	22	engineering	engineering	PROPN
cana-3401	3	23	college	college	PROPN
cana-3401	3	24	,	,	PUNCT
cana-3401	3	25	kattankulathur	kattankulathur	PROPN
cana-3401	3	26	,	,	PUNCT
cana-3401	3	27	tamil	tamil	PROPN
cana-3401	3	28	nadu	nadu	PROPN
cana-3401	3	29	,	,	PUNCT
cana-3401	3	30	india	india	PROPN
cana-3401	3	31	1*associate	1*associate	PROPN
cana-3401	3	32	professor	professor	NOUN
cana-3401	3	33	,	,	PUNCT
cana-3401	3	34	department	department	NOUN
cana-3401	3	35	of	of	ADP
cana-3401	3	36	information	information	NOUN
cana-3401	3	37	technology	technology	NOUN
cana-3401	3	38	,	,	PUNCT
cana-3401	3	39	srm	srm	PROPN
cana-3401	3	40	valliammai	valliammai	ADJ
cana-3401	3	41	engineering	engineering	PROPN
cana-3401	3	42	college	college	PROPN
cana-3401	3	43	,	,	PUNCT
cana-3401	3	44	kattankulathur	kattankulathur	PROPN
cana-3401	3	45	,	,	PUNCT
cana-3401	3	46	tamil	tamil	PROPN
cana-3401	3	47	nadu	nadu	PROPN
cana-3401	3	48	,	,	PUNCT
cana-3401	3	49	india	india	PROPN
cana-3401	3	50	2assistant	2assistant	PROPN
cana-3401	3	51	professor	professor	NOUN
cana-3401	3	52	,	,	PUNCT
cana-3401	3	53	department	department	NOUN
cana-3401	3	54	of	of	ADP
cana-3401	3	55	mathematics	mathematic	NOUN
cana-3401	3	56	,	,	PUNCT
cana-3401	3	57	srm	srm	PROPN
cana-3401	3	58	madurai	madurai	PROPN
cana-3401	3	59	college	college	PROPN
cana-3401	3	60	of	of	ADP
cana-3401	3	61	engineering	engineering	NOUN
cana-3401	3	62	and	and	CCONJ
cana-3401	3	63	technology	technology	NOUN
cana-3401	3	64	,	,	PUNCT
cana-3401	3	65	madurai	madurai	PROPN
cana-3401	3	66	,	,	PUNCT
cana-3401	3	67	tamil	tamil	PROPN
cana-3401	3	68	nadu	nadu	PROPN
cana-3401	3	69	,	,	PUNCT
cana-3401	3	70	india	india	PROPN
cana-3401	3	71	3associateprofessor	3associateprofessor	NUM
cana-3401	3	72	,	,	PUNCT
cana-3401	3	73	department	department	NOUN
cana-3401	3	74	of	of	ADP
cana-3401	3	75	mathematics	mathematic	NOUN
cana-3401	3	76	,	,	PUNCT
cana-3401	3	77	srm	srm	PROPN
cana-3401	3	78	trp	trp	PROPN
cana-3401	3	79	engineering	engineering	PROPN
cana-3401	3	80	college	college	PROPN
cana-3401	3	81	,	,	PUNCT
cana-3401	3	82	trichy	trichy	PROPN
cana-3401	3	83	,	,	PUNCT
cana-3401	3	84	tamil	tamil	PROPN
cana-3401	3	85	nadu	nadu	PROPN
cana-3401	3	86	,	,	PUNCT
cana-3401	3	87	india	india	PROPN
cana-3401	3	88	4assistant	4assistant	PROPN
cana-3401	3	89	professor	professor	NOUN
cana-3401	3	90	,	,	PUNCT
cana-3401	3	91	department	department	NOUN
cana-3401	3	92	of	of	ADP
cana-3401	3	93	mathematics	mathematic	NOUN
cana-3401	3	94	,	,	PUNCT
cana-3401	3	95	srm	srm	PROPN
cana-3401	3	96	valliammai	valliammai	PROPN
cana-3401	3	97	engineering	engineering	PROPN
cana-3401	3	98	college	college	PROPN
cana-3401	3	99	kattankulathur	kattankulathur	PROPN
cana-3401	3	100	,	,	PUNCT
cana-3401	3	101	tamil	tamil	PROPN
cana-3401	3	102	nadu	nadu	PROPN
cana-3401	3	103	,	,	PUNCT
cana-3401	3	104	india	india	PROPN
cana-3401	3	105	article	article	PROPN
cana-3401	3	106	history	history	NOUN
cana-3401	3	107	:	:	PUNCT
cana-3401	3	108	received	receive	VERB
cana-3401	3	109	:	:	PUNCT
cana-3401	3	110	22	22	NUM
cana-3401	3	111	-	-	SYM
cana-3401	3	112	10	10	NUM
cana-3401	3	113	-	-	PUNCT
cana-3401	3	114	2024	2024	NUM
cana-3401	3	115	revised:08	revised:08	ADJ
cana-3401	3	116	-	-	PUNCT
cana-3401	3	117	11	11	NUM
cana-3401	3	118	-	-	PUNCT
cana-3401	3	119	2024	2024	NUM
cana-3401	3	120	accepted:16	accepted:16	NOUN
cana-3401	3	121	-	-	PUNCT
cana-3401	3	122	12	12	NUM
cana-3401	3	123	-	-	PUNCT
cana-3401	3	124	2024	2024	NUM
cana-3401	3	125	abstract	abstract	NOUN
cana-3401	3	126	:	:	PUNCT
cana-3401	3	127	to	to	PART
cana-3401	3	128	deal	deal	VERB
cana-3401	3	129	with	with	ADP
cana-3401	3	130	difficulties	difficulty	NOUN
cana-3401	3	131	arising	arise	VERB
cana-3401	3	132	from	from	ADP
cana-3401	3	133	partitioning	partition	VERB
cana-3401	3	134	the	the	DET
cana-3401	3	135	fuzzy	fuzzy	ADJ
cana-3401	3	136	graph	graph	NOUN
cana-3401	3	137	and	and	CCONJ
cana-3401	3	138	its	its	PRON
cana-3401	3	139	connectivity	connectivity	NOUN
cana-3401	3	140	where	where	SCONJ
cana-3401	3	141	forbidden	forbid	VERB
cana-3401	3	142	induced	induced	ADJ
cana-3401	3	143	subgraphs	subgraph	NOUN
cana-3401	3	144	are	be	AUX
cana-3401	3	145	a	a	DET
cana-3401	3	146	raised	raise	VERB
cana-3401	3	147	consideration	consideration	NOUN
cana-3401	3	148	,	,	PUNCT
cana-3401	3	149	this	this	DET
cana-3401	3	150	work	work	NOUN
cana-3401	3	151	introduces	introduce	VERB
cana-3401	3	152	the	the	DET
cana-3401	3	153	concept	concept	NOUN
cana-3401	3	154	of	of	ADP
cana-3401	3	155	k	k	ADJ
cana-3401	3	156	-	-	ADJ
cana-3401	3	157	secluded	secluded	ADJ
cana-3401	3	158	vertex	vertex	NOUN
cana-3401	3	159	sets	set	NOUN
cana-3401	3	160	in	in	ADP
cana-3401	3	161	graph	graph	NOUN
cana-3401	3	162	theory	theory	NOUN
cana-3401	3	163	.	.	PUNCT
cana-3401	4	1	a	a	DET
cana-3401	4	2	vertex	vertex	NOUN
cana-3401	4	3	set	set	NOUN
cana-3401	4	4	is	be	AUX
cana-3401	4	5	defined	define	VERB
cana-3401	4	6	to	to	PART
cana-3401	4	7	be	be	AUX
cana-3401	4	8	k	k	ADP
cana-3401	4	9	secluded	secluded	ADJ
cana-3401	4	10	every	every	DET
cana-3401	4	11	piece	piece	NOUN
cana-3401	4	12	in	in	ADP
cana-3401	4	13	its	its	PRON
cana-3401	4	14	open	open	ADJ
cana-3401	4	15	neighborhood	neighborhood	NOUN
cana-3401	4	16	contains	contain	VERB
cana-3401	4	17	at	at	ADP
cana-3401	4	18	most	most	ADJ
cana-3401	4	19	k	k	PROPN
cana-3401	4	20	vertices	vertex	NOUN
cana-3401	4	21	.	.	PUNCT
cana-3401	5	1	this	this	DET
cana-3401	5	2	definition	definition	NOUN
cana-3401	5	3	generalizes	generalize	VERB
cana-3401	5	4	the	the	DET
cana-3401	5	5	classical	classical	ADJ
cana-3401	5	6	definition	definition	NOUN
cana-3401	5	7	of	of	ADP
cana-3401	5	8	important	important	ADJ
cana-3401	5	9	separators	separator	NOUN
cana-3401	5	10	to	to	PART
cana-3401	5	11	provide	provide	VERB
cana-3401	5	12	more	more	ADV
cana-3401	5	13	specific	specific	ADJ
cana-3401	5	14	method	method	NOUN
cana-3401	5	15	to	to	PART
cana-3401	5	16	find	find	VERB
cana-3401	5	17	minimal	minimal	ADJ
cana-3401	5	18	separators	separator	NOUN
cana-3401	5	19	subject	subject	ADJ
cana-3401	5	20	to	to	ADP
cana-3401	5	21	various	various	ADJ
cana-3401	5	22	restrictions	restriction	NOUN
cana-3401	5	23	.	.	PUNCT
cana-3401	6	1	our	our	PRON
cana-3401	6	2	analysis	analysis	NOUN
cana-3401	6	3	provides	provide	VERB
cana-3401	6	4	evidence	evidence	NOUN
cana-3401	6	5	that	that	PRON
cana-3401	6	6	proves	prove	VERB
cana-3401	6	7	that	that	SCONJ
cana-3401	6	8	the	the	DET
cana-3401	6	9	quantity	quantity	NOUN
cana-3401	6	10	of	of	ADP
cana-3401	6	11	connected	connected	ADJ
cana-3401	6	12	vertex	vertex	NOUN
cana-3401	6	13	sets	set	NOUN
cana-3401	6	14	of	of	ADP
cana-3401	6	15	cardinality	cardinality	PROPN
cana-3401	6	16	k	k	PROPN
cana-3401	6	17	that	that	PRON
cana-3401	6	18	contain	contain	VERB
cana-3401	6	19	a	a	DET
cana-3401	6	20	set	set	NOUN
cana-3401	6	21	ss	ss	NOUN
cana-3401	6	22	and	and	CCONJ
cana-3401	6	23	are	be	AUX
cana-3401	6	24	disjoint	disjoint	ADJ
cana-3401	6	25	from	from	ADP
cana-3401	6	26	a	a	DET
cana-3401	6	27	set	set	NOUN
cana-3401	6	28	t	t	NOUN
cana-3401	6	29	is	be	AUX
cana-3401	6	30	at	at	ADP
cana-3401	6	31	most	most	ADJ
cana-3401	6	32	4k	4k	NUM
cana-3401	6	33	.	.	PUNCT
cana-3401	7	1	this	this	DET
cana-3401	7	2	result	result	NOUN
cana-3401	7	3	extends	extend	VERB
cana-3401	7	4	previous	previous	ADJ
cana-3401	7	5	bounds	bound	NOUN
cana-3401	7	6	and	and	CCONJ
cana-3401	7	7	highlights	highlight	NOUN
cana-3401	7	8	the	the	DET
cana-3401	7	9	possibility	possibility	NOUN
cana-3401	7	10	of	of	ADP
cana-3401	7	11	the	the	DET
cana-3401	7	12	efficient	efficient	ADJ
cana-3401	7	13	enumeration	enumeration	NOUN
cana-3401	7	14	of	of	ADP
cana-3401	7	15	such	such	ADJ
cana-3401	7	16	sets	set	NOUN
cana-3401	7	17	.	.	PUNCT
cana-3401	8	1	we	we	PRON
cana-3401	8	2	further	far	ADV
cana-3401	8	3	generalize	generalize	VERB
cana-3401	8	4	this	this	DET
cana-3401	8	5	notion	notion	NOUN
cana-3401	8	6	to	to	PART
cana-3401	8	7	graphs	graph	NOUN
cana-3401	8	8	not	not	PART
cana-3401	8	9	containing	contain	VERB
cana-3401	8	10	a	a	DET
cana-3401	8	11	particular	particular	ADJ
cana-3401	8	12	finite	finite	NOUN
cana-3401	8	13	set	set	VERB
cana-3401	8	14	f	f	PROPN
cana-3401	8	15	of	of	ADP
cana-3401	8	16	forbidden	forbid	VERB
cana-3401	8	17	induced	induced	ADJ
cana-3401	8	18	subgraphs	subgraph	NOUN
cana-3401	8	19	and	and	CCONJ
cana-3401	8	20	prove	prove	VERB
cana-3401	8	21	that	that	SCONJ
cana-3401	8	22	in	in	ADP
cana-3401	8	23	this	this	DET
cana-3401	8	24	case	case	NOUN
cana-3401	8	25	the	the	DET
cana-3401	8	26	number	number	NOUN
cana-3401	8	27	of	of	ADP
cana-3401	8	28	maximal	maximal	ADJ
cana-3401	8	29	subgraphs	subgraph	NOUN
cana-3401	8	30	remains	remain	VERB
cana-3401	8	31	between	between	ADP
cana-3401	8	32	2o(k	2o(k	NUM
cana-3401	8	33	)	)	PUNCT
cana-3401	8	34	hence	hence	ADV
cana-3401	8	35	computable	computable	ADJ
cana-3401	8	36	.	.	PUNCT
cana-3401	9	1	the	the	DET
cana-3401	9	2	main	main	ADJ
cana-3401	9	3	contribution	contribution	NOUN
cana-3401	9	4	of	of	ADP
cana-3401	9	5	our	our	PRON
cana-3401	9	6	work	work	NOUN
cana-3401	9	7	is	be	AUX
cana-3401	9	8	to	to	PART
cana-3401	9	9	propose	propose	VERB
cana-3401	9	10	a	a	DET
cana-3401	9	11	new	new	ADJ
cana-3401	9	12	enumeration	enumeration	NOUN
cana-3401	9	13	strategy	strategy	NOUN
cana-3401	9	14	for	for	ADP
cana-3401	9	15	identifying	identify	VERB
cana-3401	9	16	all	all	DET
cana-3401	9	17	mvs	mvs	PROPN
cana-3401	9	18	(	(	PUNCT
cana-3401	9	19	k	k	NOUN
cana-3401	9	20	)	)	PUNCT
cana-3401	9	21	in	in	ADP
cana-3401	9	22	a	a	DET
cana-3401	9	23	fuzzy	fuzzy	ADJ
cana-3401	9	24	graph	graph	NOUN
cana-3401	9	25	.	.	PUNCT
cana-3401	10	1	this	this	DET
cana-3401	10	2	algorithm	algorithm	NOUN
cana-3401	10	3	greatly	greatly	ADV
cana-3401	10	4	improves	improve	VERB
cana-3401	10	5	the	the	DET
cana-3401	10	6	efficiency	efficiency	NOUN
cana-3401	10	7	of	of	ADP
cana-3401	10	8	solving	solve	VERB
cana-3401	10	9	the	the	DET
cana-3401	10	10	connected	connected	ADJ
cana-3401	10	11	k	k	PROPN
cana-3401	10	12	secluded	secluded	ADJ
cana-3401	10	13	f	f	NOUN
cana-3401	10	14	-	-	PUNCT
cana-3401	10	15	free	free	ADJ
cana-3401	10	16	subgraph	subgraph	NOUN
cana-3401	10	17	problem	problem	NOUN
cana-3401	10	18	for	for	ADP
cana-3401	10	19	which	which	PRON
cana-3401	10	20	the	the	DET
cana-3401	10	21	current	current	ADJ
cana-3401	10	22	accuracy	accuracy	NOUN
cana-3401	10	23	is	be	AUX
cana-3401	10	24	70	70	NUM
cana-3401	10	25	%	%	NOUN
cana-3401	10	26	while	while	SCONJ
cana-3401	10	27	its	its	PRON
cana-3401	10	28	improved	improved	ADJ
cana-3401	10	29	algorithm	algorithm	NOUN
cana-3401	10	30	provides	provide	VERB
cana-3401	10	31	92	92	NUM
cana-3401	10	32	%	%	NOUN
cana-3401	10	33	accuracy	accuracy	NOUN
cana-3401	10	34	.	.	PUNCT
cana-3401	11	1	the	the	DET
cana-3401	11	2	work	work	NOUN
cana-3401	11	3	constitutes	constitute	VERB
cana-3401	11	4	a	a	DET
cana-3401	11	5	significant	significant	ADJ
cana-3401	11	6	achievement	achievement	NOUN
cana-3401	11	7	in	in	ADP
cana-3401	11	8	new	new	ADJ
cana-3401	11	9	methods	method	NOUN
cana-3401	11	10	of	of	ADP
cana-3401	11	11	fuzzy	fuzzy	ADJ
cana-3401	11	12	graph	graph	NOUN
cana-3401	11	13	partitioning	partitioning	NOUN
cana-3401	11	14	,	,	PUNCT
cana-3401	11	15	algorithms	algorithm	NOUN
cana-3401	11	16	for	for	ADP
cana-3401	11	17	counting	counting	NOUN
cana-3401	11	18	,	,	PUNCT
cana-3401	11	19	and	and	CCONJ
cana-3401	11	20	research	research	NOUN
cana-3401	11	21	on	on	ADP
cana-3401	11	22	crucial	crucial	ADJ
cana-3401	11	23	separators	separator	NOUN
cana-3401	11	24	under	under	ADP
cana-3401	11	25	various	various	ADJ
cana-3401	11	26	constraints	constraint	NOUN
cana-3401	11	27	for	for	ADP
cana-3401	11	28	application	application	NOUN
cana-3401	11	29	in	in	ADP
cana-3401	11	30	network	network	NOUN
cana-3401	11	31	analysis	analysis	NOUN
cana-3401	11	32	and	and	CCONJ
cana-3401	11	33	algorithmic	algorithmic	ADJ
cana-3401	11	34	graph	graph	NOUN
cana-3401	11	35	theories	theory	NOUN
cana-3401	11	36	.	.	PUNCT
cana-3401	12	1	keywords	keyword	NOUN
cana-3401	12	2	:	:	PUNCT
cana-3401	12	3	k	k	ADJ
cana-3401	12	4	-	-	ADJ
cana-3401	12	5	secluded	secluded	ADJ
cana-3401	12	6	vertex	vertex	NOUN
cana-3401	12	7	sets	set	NOUN
cana-3401	12	8	,	,	PUNCT
cana-3401	12	9	important	important	ADJ
cana-3401	12	10	separators	separator	NOUN
cana-3401	12	11	,	,	PUNCT
cana-3401	12	12	forbidden	forbid	VERB
cana-3401	12	13	induced	induced	ADJ
cana-3401	12	14	subgraphs	subgraph	NOUN
cana-3401	12	15	,	,	PUNCT
cana-3401	12	16	the	the	DET
cana-3401	12	17	enumeration	enumeration	NOUN
cana-3401	12	18	algorithm	algorithm	NOUN
cana-3401	12	19	,	,	PUNCT
cana-3401	12	20	graph	graph	NOUN
cana-3401	12	21	partitioning	partitioning	NOUN
cana-3401	12	22	,	,	PUNCT
cana-3401	12	23	the	the	DET
cana-3401	12	24	connected	connected	ADJ
cana-3401	12	25	k	k	ADJ
cana-3401	12	26	-	-	ADJ
cana-3401	12	27	secluded	secluded	ADJ
cana-3401	12	28	f	f	NOUN
cana-3401	12	29	-	-	PUNCT
cana-3401	12	30	free	free	ADJ
cana-3401	12	31	subgraph	subgraph	NOUN
cana-3401	12	32	,	,	PUNCT
cana-3401	12	33	improvement	improvement	NOUN
cana-3401	12	34	of	of	ADP
cana-3401	12	35	accuracy	accuracy	NOUN
cana-3401	12	36	,	,	PUNCT
cana-3401	12	37	and	and	CCONJ
cana-3401	12	38	complexity	complexity	NOUN
cana-3401	12	39	of	of	ADP
cana-3401	12	40	computation	computation	NOUN
cana-3401	12	41	.	.	PUNCT
cana-3401	13	1	mailto:1vijayalakshmiv.maths@srmvalliammai.ac.in	mailto:1vijayalakshmiv.maths@srmvalliammai.ac.in	PROPN
cana-3401	13	2	mailto:drkiyappan@gmail.com	mailto:drkiyappan@gmail.com	PROPN
cana-3401	14	1	mailto:aysha.maths@srmvalliammai.ac.in	mailto:aysha.maths@srmvalliammai.ac.in	PROPN
cana-3401	14	2	communications	communication	NOUN
cana-3401	14	3	on	on	ADP
cana-3401	14	4	applied	apply	VERB
cana-3401	14	5	nonlinear	nonlinear	ADJ
cana-3401	14	6	analysis	analysis	NOUN
cana-3401	14	7	issn	issn	NOUN
cana-3401	14	8	:	:	PUNCT
cana-3401	14	9	1074	1074	NUM
cana-3401	14	10	-	-	PUNCT
cana-3401	14	11	133x	133x	NUM
cana-3401	14	12	vol	vol	NOUN
cana-3401	14	13	32	32	NUM
cana-3401	14	14	no	no	NOUN
cana-3401	14	15	.	.	PUNCT
cana-3401	15	1	7s	7	NOUN
cana-3401	15	2	(	(	PUNCT
cana-3401	15	3	2025	2025	NUM
cana-3401	15	4	)	)	PUNCT
cana-3401	15	5	297	297	NUM
cana-3401	15	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	15	7	introduction	introduction	NOUN
cana-3401	15	8	as	as	ADP
cana-3401	15	9	a	a	DET
cana-3401	15	10	basic	basic	ADJ
cana-3401	15	11	subproblem	subproblem	NOUN
cana-3401	15	12	of	of	ADP
cana-3401	15	13	graph	graph	NOUN
cana-3401	15	14	decomposition	decomposition	NOUN
cana-3401	15	15	,	,	PUNCT
cana-3401	15	16	graph	graph	NOUN
cana-3401	15	17	partitioning	partitioning	NOUN
cana-3401	15	18	is	be	AUX
cana-3401	15	19	an	an	DET
cana-3401	15	20	important	important	ADJ
cana-3401	15	21	problem	problem	NOUN
cana-3401	15	22	in	in	ADP
cana-3401	15	23	computer	computer	NOUN
cana-3401	15	24	science	science	NOUN
cana-3401	15	25	and	and	CCONJ
cana-3401	15	26	mathematics	mathematic	NOUN
cana-3401	15	27	,	,	PUNCT
cana-3401	15	28	which	which	PRON
cana-3401	15	29	has	have	VERB
cana-3401	15	30	broad	broad	ADJ
cana-3401	15	31	application	application	NOUN
cana-3401	15	32	prospects	prospect	NOUN
cana-3401	15	33	in	in	ADP
cana-3401	15	34	network	network	NOUN
cana-3401	15	35	analysis	analysis	NOUN
cana-3401	15	36	,	,	PUNCT
cana-3401	15	37	parallel	parallel	ADJ
cana-3401	15	38	computing	computing	NOUN
cana-3401	15	39	,	,	PUNCT
cana-3401	15	40	clustering	clustering	ADJ
cana-3401	15	41	,	,	PUNCT
cana-3401	15	42	social	social	ADJ
cana-3401	15	43	networks	network	NOUN
cana-3401	15	44	,	,	PUNCT
cana-3401	15	45	etc	etc	X
cana-3401	15	46	.	.	X
cana-3401	16	1	[	[	X
cana-3401	16	2	1	1	X
cana-3401	16	3	]	]	PUNCT
cana-3401	16	4	essentially	essentially	ADV
cana-3401	16	5	,	,	PUNCT
cana-3401	16	6	graph	graph	NOUN
cana-3401	16	7	partitioning	partitioning	NOUN
cana-3401	16	8	is	be	AUX
cana-3401	16	9	the	the	DET
cana-3401	16	10	process	process	NOUN
cana-3401	16	11	of	of	ADP
cana-3401	16	12	splitting	split	VERB
cana-3401	16	13	a	a	DET
cana-3401	16	14	particular	particular	ADJ
cana-3401	16	15	graph	graph	NOUN
cana-3401	16	16	into	into	ADP
cana-3401	16	17	several	several	ADJ
cana-3401	16	18	other	other	ADJ
cana-3401	16	19	disjoint	disjoint	ADJ
cana-3401	16	20	sub	sub	NOUN
cana-3401	16	21	graphs	graph	NOUN
cana-3401	16	22	that	that	PRON
cana-3401	16	23	share	share	VERB
cana-3401	16	24	no	no	DET
cana-3401	16	25	common	common	ADJ
cana-3401	16	26	vertex	vertex	NOUN
cana-3401	16	27	,	,	PUNCT
cana-3401	16	28	and	and	CCONJ
cana-3401	16	29	the	the	DET
cana-3401	16	30	idea	idea	NOUN
cana-3401	16	31	here	here	ADV
cana-3401	16	32	is	be	AUX
cana-3401	16	33	to	to	PART
cana-3401	16	34	optimize	optimize	VERB
cana-3401	16	35	for	for	ADP
cana-3401	16	36	a	a	DET
cana-3401	16	37	certain	certain	ADJ
cana-3401	16	38	attribute	attribute	NOUN
cana-3401	16	39	,	,	PUNCT
cana-3401	16	40	often	often	ADV
cana-3401	16	41	,	,	PUNCT
cana-3401	16	42	the	the	DET
cana-3401	16	43	threshold	threshold	NOUN
cana-3401	16	44	of	of	ADP
cana-3401	16	45	the	the	DET
cana-3401	16	46	cuts	cut	NOUN
cana-3401	16	47	.	.	PUNCT
cana-3401	17	1	[	[	X
cana-3401	17	2	2	2	X
cana-3401	17	3	]	]	PUNCT
cana-3401	17	4	however	however	ADV
cana-3401	17	5	,	,	PUNCT
cana-3401	17	6	in	in	ADP
cana-3401	17	7	many	many	ADJ
cana-3401	17	8	practical	practical	ADJ
cana-3401	17	9	problems	problem	NOUN
cana-3401	17	10	,	,	PUNCT
cana-3401	17	11	more	more	ADJ
cana-3401	17	12	requirements	requirement	NOUN
cana-3401	17	13	must	must	AUX
cana-3401	17	14	be	be	AUX
cana-3401	17	15	imposed	impose	VERB
cana-3401	17	16	to	to	PART
cana-3401	17	17	make	make	VERB
cana-3401	17	18	the	the	DET
cana-3401	17	19	partitioning	partition	VERB
cana-3401	17	20	more	more	ADV
cana-3401	17	21	useful	useful	ADJ
cana-3401	17	22	and	and	CCONJ
cana-3401	17	23	realistic	realistic	ADJ
cana-3401	17	24	.	.	PUNCT
cana-3401	18	1	one	one	NUM
cana-3401	18	2	of	of	ADP
cana-3401	18	3	such	such	ADJ
cana-3401	18	4	important	important	ADJ
cana-3401	18	5	constraints	constraint	NOUN
cana-3401	18	6	involves	involve	VERB
cana-3401	18	7	k	k	ADJ
cana-3401	18	8	-	-	ADJ
cana-3401	18	9	secluded	secluded	ADJ
cana-3401	18	10	vertex	vertex	NOUN
cana-3401	18	11	sets	set	NOUN
cana-3401	18	12	.	.	PUNCT
cana-3401	19	1	[	[	X
cana-3401	19	2	3	3	X
cana-3401	19	3	]	]	PUNCT
cana-3401	19	4	a	a	DET
cana-3401	19	5	k	k	ADJ
cana-3401	19	6	-	-	ADJ
cana-3401	19	7	secluded	secluded	ADJ
cana-3401	19	8	vertex	vertex	NOUN
cana-3401	19	9	set	set	NOUN
cana-3401	19	10	is	be	AUX
cana-3401	19	11	further	far	ADV
cana-3401	19	12	defined	define	VERB
cana-3401	19	13	as	as	ADP
cana-3401	19	14	subset	subset	VERB
cana-3401	19	15	v	v	NOUN
cana-3401	19	16	of	of	ADP
cana-3401	19	17	a	a	DET
cana-3401	19	18	graph	graph	NOUN
cana-3401	19	19	g	g	ADP
cana-3401	19	20	such	such	ADJ
cana-3401	19	21	that	that	SCONJ
cana-3401	19	22	each	each	DET
cana-3401	19	23	vertex	vertex	NOUN
cana-3401	19	24	in	in	ADP
cana-3401	19	25	the	the	DET
cana-3401	19	26	set	set	NOUN
cana-3401	19	27	v	v	NOUN
cana-3401	19	28	is	be	AUX
cana-3401	19	29	at	at	ADP
cana-3401	19	30	least	least	ADJ
cana-3401	19	31	k	k	NOUN
cana-3401	19	32	edge	edge	NOUN
cana-3401	19	33	away	away	ADV
cana-3401	19	34	from	from	ADP
cana-3401	19	35	any	any	DET
cana-3401	19	36	vertex	vertex	NOUN
cana-3401	19	37	which	which	PRON
cana-3401	19	38	is	be	AUX
cana-3401	19	39	not	not	PART
cana-3401	19	40	a	a	DET
cana-3401	19	41	vertex	vertex	NOUN
cana-3401	19	42	of	of	ADP
cana-3401	19	43	v.	v.	PROPN
cana-3401	20	1	[	[	X
cana-3401	20	2	4	4	NUM
cana-3401	20	3	]	]	X
cana-3401	20	4	k	k	ADJ
cana-3401	20	5	-	-	PUNCT
cana-3401	20	6	seclusion	seclusion	NOUN
cana-3401	20	7	is	be	AUX
cana-3401	20	8	valuable	valuable	ADJ
cana-3401	20	9	when	when	SCONJ
cana-3401	20	10	one	one	NUM
cana-3401	20	11	or	or	CCONJ
cana-3401	20	12	many	many	ADJ
cana-3401	20	13	certain	certain	ADJ
cana-3401	20	14	subsets	subset	NOUN
cana-3401	20	15	of	of	ADP
cana-3401	20	16	vertices	vertex	NOUN
cana-3401	20	17	should	should	AUX
cana-3401	20	18	not	not	PART
cana-3401	20	19	be	be	AUX
cana-3401	20	20	connected	connect	VERB
cana-3401	20	21	or	or	CCONJ
cana-3401	20	22	blended	blend	VERB
cana-3401	20	23	with	with	ADP
cana-3401	20	24	other	other	ADJ
cana-3401	20	25	distinct	distinct	ADJ
cana-3401	20	26	subsets	subset	NOUN
cana-3401	20	27	of	of	ADP
cana-3401	20	28	vertices	vertex	NOUN
cana-3401	20	29	in	in	ADP
cana-3401	20	30	some	some	DET
cana-3401	20	31	ways	way	NOUN
cana-3401	20	32	in	in	ADP
cana-3401	20	33	the	the	DET
cana-3401	20	34	graph	graph	NOUN
cana-3401	20	35	.	.	PUNCT
cana-3401	21	1	this	this	PRON
cana-3401	21	2	becomes	become	VERB
cana-3401	21	3	especially	especially	ADV
cana-3401	21	4	critical	critical	ADJ
cana-3401	21	5	when	when	SCONJ
cana-3401	21	6	handling	handle	VERB
cana-3401	21	7	large	large	ADJ
cana-3401	21	8	and	and	CCONJ
cana-3401	21	9	complex	complex	ADJ
cana-3401	21	10	graphs	graph	NOUN
cana-3401	21	11	in	in	ADP
cana-3401	21	12	a	a	DET
cana-3401	21	13	network	network	NOUN
cana-3401	21	14	and	and	CCONJ
cana-3401	21	15	where	where	SCONJ
cana-3401	21	16	the	the	DET
cana-3401	21	17	topology	topology	NOUN
cana-3401	21	18	of	of	ADP
cana-3401	21	19	the	the	DET
cana-3401	21	20	graph	graph	NOUN
cana-3401	21	21	largely	largely	ADV
cana-3401	21	22	determines	determine	VERB
cana-3401	21	23	the	the	DET
cana-3401	21	24	nature	nature	NOUN
cana-3401	21	25	of	of	ADP
cana-3401	21	26	the	the	DET
cana-3401	21	27	system	system	NOUN
cana-3401	21	28	or	or	CCONJ
cana-3401	21	29	even	even	ADV
cana-3401	21	30	its	its	PRON
cana-3401	21	31	analysis	analysis	NOUN
cana-3401	21	32	.	.	PUNCT
cana-3401	22	1	originally	originally	ADV
cana-3401	22	2	,	,	PUNCT
cana-3401	22	3	the	the	DET
cana-3401	22	4	research	research	NOUN
cana-3401	22	5	considers	consider	VERB
cana-3401	22	6	how	how	SCONJ
cana-3401	22	7	to	to	PART
cana-3401	22	8	enumerate	enumerate	VERB
cana-3401	22	9	these	these	DET
cana-3401	22	10	ksecluded	kseclude	VERB
cana-3401	22	11	vertex	vertex	NOUN
cana-3401	22	12	sets	set	NOUN
cana-3401	22	13	in	in	ADP
cana-3401	22	14	polynomial	polynomial	ADJ
cana-3401	22	15	time	time	NOUN
cana-3401	22	16	and	and	CCONJ
cana-3401	22	17	subject	subject	ADJ
cana-3401	22	18	to	to	ADP
cana-3401	22	19	forbidden	forbid	VERB
cana-3401	22	20	induced	induced	ADJ
cana-3401	22	21	subgraph	subgraph	NOUN
cana-3401	22	22	conditions	condition	NOUN
cana-3401	22	23	.	.	PUNCT
cana-3401	23	1	[	[	X
cana-3401	23	2	5	5	NUM
cana-3401	23	3	]	]	PUNCT
cana-3401	23	4	induced	induced	ADJ
cana-3401	23	5	subgraph	subgraph	NOUN
cana-3401	23	6	constraints	constraint	NOUN
cana-3401	23	7	involve	involve	VERB
cana-3401	23	8	restrictions	restriction	NOUN
cana-3401	23	9	placed	place	VERB
cana-3401	23	10	on	on	ADP
cana-3401	23	11	the	the	DET
cana-3401	23	12	type	type	NOUN
cana-3401	23	13	of	of	ADP
cana-3401	23	14	structures	structure	NOUN
cana-3401	23	15	which	which	PRON
cana-3401	23	16	can	can	AUX
cana-3401	23	17	arise	arise	VERB
cana-3401	23	18	in	in	ADP
cana-3401	23	19	any	any	PRON
cana-3401	23	20	of	of	ADP
cana-3401	23	21	the	the	DET
cana-3401	23	22	induced	induced	ADJ
cana-3401	23	23	subgraphs	subgraph	NOUN
cana-3401	23	24	of	of	ADP
cana-3401	23	25	the	the	DET
cana-3401	23	26	partitioned	partition	VERB
cana-3401	23	27	sets	set	NOUN
cana-3401	23	28	.	.	PUNCT
cana-3401	24	1	some	some	PRON
cana-3401	24	2	of	of	ADP
cana-3401	24	3	the	the	DET
cana-3401	24	4	possible	possible	ADJ
cana-3401	24	5	graph	graph	NOUN
cana-3401	24	6	motifs	motif	NOUN
cana-3401	24	7	or	or	CCONJ
cana-3401	24	8	configurations	configuration	NOUN
cana-3401	24	9	may	may	AUX
cana-3401	24	10	not	not	PART
cana-3401	24	11	allow	allow	VERB
cana-3401	24	12	partitions	partition	NOUN
cana-3401	24	13	within	within	ADP
cana-3401	24	14	our	our	PRON
cana-3401	24	15	partitions	partition	NOUN
cana-3401	24	16	further	far	ADV
cana-3401	24	17	complicating	complicate	VERB
cana-3401	24	18	the	the	DET
cana-3401	24	19	partitioning	partitioning	ADJ
cana-3401	24	20	issue	issue	NOUN
cana-3401	24	21	.	.	PUNCT
cana-3401	25	1	[	[	X
cana-3401	25	2	6	6	NUM
cana-3401	25	3	]	]	PUNCT
cana-3401	25	4	these	these	DET
cana-3401	25	5	restrictions	restriction	NOUN
cana-3401	25	6	are	be	AUX
cana-3401	25	7	most	most	ADV
cana-3401	25	8	appropriate	appropriate	ADJ
cana-3401	25	9	in	in	ADP
cana-3401	25	10	such	such	ADJ
cana-3401	25	11	contexts	context	NOUN
cana-3401	25	12	as	as	ADP
cana-3401	25	13	circuit	circuit	NOUN
cana-3401	25	14	layout	layout	NOUN
cana-3401	25	15	,	,	PUNCT
cana-3401	25	16	molecular	molecular	ADJ
cana-3401	25	17	network	network	NOUN
cana-3401	25	18	topology	topology	NOUN
cana-3401	25	19	,	,	PUNCT
cana-3401	25	20	or	or	CCONJ
cana-3401	25	21	segmenting	segment	VERB
cana-3401	25	22	social	social	ADJ
cana-3401	25	23	networks	network	NOUN
cana-3401	25	24	by	by	ADP
cana-3401	25	25	the	the	DET
cana-3401	25	26	non	non	ADJ
cana-3401	25	27	existence	existence	NOUN
cana-3401	25	28	of	of	ADP
cana-3401	25	29	certain	certain	ADJ
cana-3401	25	30	subgraphs	subgraph	NOUN
cana-3401	25	31	.	.	PUNCT
cana-3401	26	1	fig.1	fig.1	INTJ
cana-3401	26	2	.	.	PUNCT
cana-3401	27	1	k	k	ADJ
cana-3401	27	2	-	-	ADJ
cana-3401	27	3	secluded	secluded	ADJ
cana-3401	27	4	subgraphs	subgraphs	NOUN
cana-3401	27	5	this	this	PRON
cana-3401	27	6	is	be	AUX
cana-3401	27	7	bound	bind	VERB
cana-3401	27	8	to	to	PART
cana-3401	27	9	present	present	VERB
cana-3401	27	10	the	the	DET
cana-3401	27	11	main	main	ADJ
cana-3401	27	12	challenge	challenge	NOUN
cana-3401	27	13	in	in	ADP
cana-3401	27	14	solving	solve	VERB
cana-3401	27	15	this	this	DET
cana-3401	27	16	problem	problem	NOUN
cana-3401	27	17	since	since	SCONJ
cana-3401	27	18	the	the	DET
cana-3401	27	19	process	process	NOUN
cana-3401	27	20	of	of	ADP
cana-3401	27	21	enumerating	enumerate	VERB
cana-3401	27	22	all	all	DET
cana-3401	27	23	valid	valid	ADJ
cana-3401	27	24	k	k	ADJ
cana-3401	27	25	-	-	ADJ
cana-3401	27	26	secluded	secluded	ADJ
cana-3401	27	27	vertex	vertex	NOUN
cana-3401	27	28	sets	set	NOUN
cana-3401	27	29	that	that	PRON
cana-3401	27	30	satisfy	satisfy	VERB
cana-3401	27	31	the	the	DET
cana-3401	27	32	rule	rule	NOUN
cana-3401	27	33	against	against	ADP
cana-3401	27	34	formation	formation	NOUN
cana-3401	27	35	of	of	ADP
cana-3401	27	36	forbidden	forbid	VERB
cana-3401	27	37	subgraph	subgraph	NOUN
cana-3401	27	38	is	be	AUX
cana-3401	27	39	not	not	PART
cana-3401	27	40	easy.[7	easy.[7	NOUN
cana-3401	27	41	]	]	PUNCT
cana-3401	27	42	however	however	ADV
cana-3401	27	43	,	,	PUNCT
cana-3401	27	44	enumeration	enumeration	NOUN
cana-3401	27	45	based	base	VERB
cana-3401	27	46	on	on	ADP
cana-3401	27	47	the	the	DET
cana-3401	27	48	data	data	NOUN
cana-3401	27	49	graph	graph	NOUN
cana-3401	27	50	becomes	become	VERB
cana-3401	27	51	infeasible	infeasible	ADJ
cana-3401	27	52	when	when	SCONJ
cana-3401	27	53	the	the	DET
cana-3401	27	54	size	size	NOUN
cana-3401	27	55	of	of	ADP
cana-3401	27	56	the	the	DET
cana-3401	27	57	graph	graph	NOUN
cana-3401	27	58	increases	increase	NOUN
cana-3401	27	59	since	since	SCONJ
cana-3401	27	60	the	the	DET
cana-3401	27	61	number	number	NOUN
cana-3401	27	62	of	of	ADP
cana-3401	27	63	possible	possible	ADJ
cana-3401	27	64	vertex	vertex	NOUN
cana-3401	27	65	sets	set	NOUN
cana-3401	27	66	increases	increase	VERB
cana-3401	27	67	exponentially	exponentially	ADV
cana-3401	27	68	.	.	PUNCT
cana-3401	28	1	fig.1	fig.1	ADJ
cana-3401	28	2	hence	hence	ADV
cana-3401	28	3	the	the	DET
cana-3401	28	4	research	research	NOUN
cana-3401	28	5	aims	aim	VERB
cana-3401	28	6	at	at	ADP
cana-3401	28	7	designing	design	VERB
cana-3401	28	8	algorithms	algorithm	NOUN
cana-3401	28	9	of	of	ADP
cana-3401	28	10	higher	high	ADJ
cana-3401	28	11	efficiency	efficiency	NOUN
cana-3401	28	12	which	which	PRON
cana-3401	28	13	will	will	AUX
cana-3401	28	14	find	find	VERB
cana-3401	28	15	only	only	ADV
cana-3401	28	16	those	those	DET
cana-3401	28	17	vertex	vertex	NOUN
cana-3401	28	18	sets	set	NOUN
cana-3401	28	19	satisfying	satisfy	VERB
cana-3401	28	20	both	both	CCONJ
cana-3401	28	21	the	the	DET
cana-3401	28	22	k	k	NOUN
cana-3401	28	23	-	-	NOUN
cana-3401	28	24	seclusion	seclusion	NOUN
cana-3401	28	25	and	and	CCONJ
cana-3401	28	26	forbidden	forbid	VERB
cana-3401	28	27	subgraph	subgraph	NOUN
cana-3401	28	28	properties	property	NOUN
cana-3401	28	29	but	but	CCONJ
cana-3401	28	30	not	not	PART
cana-3401	28	31	necessitating	necessitate	VERB
cana-3401	28	32	exhaustive	exhaustive	ADJ
cana-3401	28	33	search	search	NOUN
cana-3401	28	34	.	.	PUNCT
cana-3401	29	1	efficient	efficient	ADJ
cana-3401	29	2	enumeration	enumeration	NOUN
cana-3401	29	3	algorithms	algorithm	NOUN
cana-3401	29	4	:	:	PUNCT
cana-3401	29	5	the	the	DET
cana-3401	29	6	study	study	NOUN
cana-3401	29	7	deals	deal	VERB
cana-3401	29	8	with	with	ADP
cana-3401	29	9	the	the	DET
cana-3401	29	10	identification	identification	NOUN
cana-3401	29	11	of	of	ADP
cana-3401	29	12	complex	complex	ADJ
cana-3401	29	13	algorithmic	algorithmic	ADJ
cana-3401	29	14	solutions	solution	NOUN
cana-3401	29	15	for	for	ADP
cana-3401	29	16	finding	find	VERB
cana-3401	29	17	ksecluded	kseclude	VERB
cana-3401	29	18	vertex	vertex	NOUN
cana-3401	29	19	sets	set	NOUN
cana-3401	29	20	in	in	ADP
cana-3401	29	21	which	which	PRON
cana-3401	29	22	one	one	NOUN
cana-3401	29	23	does	do	AUX
cana-3401	29	24	not	not	PART
cana-3401	29	25	need	need	VERB
cana-3401	29	26	to	to	PART
cana-3401	29	27	check	check	VERB
cana-3401	29	28	all	all	DET
cana-3401	29	29	the	the	DET
cana-3401	29	30	possibilities	possibility	NOUN
cana-3401	29	31	.	.	PUNCT
cana-3401	30	1	[	[	X
cana-3401	30	2	9	9	X
cana-3401	30	3	]	]	PUNCT
cana-3401	30	4	these	these	DET
cana-3401	30	5	methods	method	NOUN
cana-3401	30	6	wish	wish	VERB
cana-3401	30	7	to	to	PART
cana-3401	30	8	decrease	decrease	VERB
cana-3401	30	9	the	the	DET
cana-3401	30	10	issue	issue	NOUN
cana-3401	30	11	of	of	ADP
cana-3401	30	12	computationally	computationally	ADV
cana-3401	30	13	intensive	intensive	ADJ
cana-3401	30	14	by	by	ADP
cana-3401	30	15	jettisoning	jettison	VERB
cana-3401	30	16	unhelpful	unhelpful	ADJ
cana-3401	30	17	solutions	solution	NOUN
cana-3401	30	18	from	from	ADP
cana-3401	30	19	the	the	DET
cana-3401	30	20	search	search	NOUN
cana-3401	30	21	space	space	NOUN
cana-3401	30	22	.	.	PUNCT
cana-3401	31	1	pruning	prune	VERB
cana-3401	31	2	techniques	technique	NOUN
cana-3401	31	3	:	:	PUNCT
cana-3401	31	4	with	with	ADP
cana-3401	31	5	respect	respect	NOUN
cana-3401	31	6	to	to	ADP
cana-3401	31	7	the	the	DET
cana-3401	31	8	induced	induced	ADJ
cana-3401	31	9	subgraph	subgraph	NOUN
cana-3401	31	10	constraints	constraint	NOUN
cana-3401	31	11	,	,	PUNCT
cana-3401	31	12	the	the	DET
cana-3401	31	13	research	research	NOUN
cana-3401	31	14	also	also	ADV
cana-3401	31	15	considers	consider	VERB
cana-3401	31	16	how	how	SCONJ
cana-3401	31	17	one	one	NOUN
cana-3401	31	18	can	can	AUX
cana-3401	31	19	prunes	prune	VERB
cana-3401	31	20	vertex	vertex	NOUN
cana-3401	31	21	sets	set	NOUN
cana-3401	31	22	that	that	PRON
cana-3401	31	23	are	be	AUX
cana-3401	31	24	known	know	VERB
cana-3401	31	25	never	never	ADV
cana-3401	31	26	to	to	PART
cana-3401	31	27	satisfy	satisfy	VERB
cana-3401	31	28	the	the	DET
cana-3401	31	29	constraints	constraint	NOUN
cana-3401	31	30	.	.	PUNCT
cana-3401	32	1	[	[	X
cana-3401	32	2	8	8	NUM
cana-3401	32	3	]	]	X
cana-3401	32	4	[	[	X
cana-3401	32	5	9	9	NUM
cana-3401	32	6	]	]	PUNCT
cana-3401	32	7	.	.	PUNCT
cana-3401	33	1	this	this	PRON
cana-3401	33	2	makes	make	VERB
cana-3401	33	3	it	it	PRON
cana-3401	33	4	less	less	ADV
cana-3401	33	5	burdensome	burdensome	ADJ
cana-3401	33	6	to	to	PART
cana-3401	33	7	have	have	VERB
cana-3401	33	8	to	to	PART
cana-3401	33	9	do	do	VERB
cana-3401	33	10	a	a	DET
cana-3401	33	11	lot	lot	NOUN
cana-3401	33	12	of	of	ADP
cana-3401	33	13	calculations	calculation	NOUN
cana-3401	33	14	and	and	CCONJ
cana-3401	33	15	makes	make	VERB
cana-3401	33	16	the	the	DET
cana-3401	33	17	process	process	NOUN
cana-3401	33	18	faster	fast	ADV
cana-3401	33	19	.	.	PUNCT
cana-3401	34	1	communications	communication	NOUN
cana-3401	34	2	on	on	ADP
cana-3401	34	3	applied	apply	VERB
cana-3401	34	4	nonlinear	nonlinear	ADJ
cana-3401	34	5	analysis	analysis	NOUN
cana-3401	34	6	issn	issn	NOUN
cana-3401	34	7	:	:	PUNCT
cana-3401	34	8	1074	1074	NUM
cana-3401	34	9	-	-	PUNCT
cana-3401	34	10	133x	133x	NUM
cana-3401	34	11	vol	vol	NOUN
cana-3401	34	12	32	32	NUM
cana-3401	34	13	no	no	NOUN
cana-3401	34	14	.	.	PUNCT
cana-3401	35	1	7s	7	NOUN
cana-3401	35	2	(	(	PUNCT
cana-3401	35	3	2025	2025	NUM
cana-3401	35	4	)	)	PUNCT
cana-3401	35	5	298	298	NUM
cana-3401	35	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	35	7	optimization	optimization	NOUN
cana-3401	35	8	approaches	approach	VERB
cana-3401	35	9	:	:	PUNCT
cana-3401	35	10	the	the	DET
cana-3401	35	11	enumeration	enumeration	NOUN
cana-3401	35	12	is	be	AUX
cana-3401	35	13	integrated	integrate	VERB
cana-3401	35	14	with	with	ADP
cana-3401	35	15	optimization	optimization	NOUN
cana-3401	35	16	techniques	technique	NOUN
cana-3401	35	17	which	which	PRON
cana-3401	35	18	are	be	AUX
cana-3401	35	19	greedy	greedy	ADJ
cana-3401	35	20	algorithms	algorithm	NOUN
cana-3401	35	21	,	,	PUNCT
cana-3401	35	22	dynamic	dynamic	ADJ
cana-3401	35	23	programming	programming	NOUN
cana-3401	35	24	,	,	PUNCT
cana-3401	35	25	and	and	CCONJ
cana-3401	35	26	heuristics	heuristic	NOUN
cana-3401	35	27	particular	particular	ADJ
cana-3401	35	28	to	to	PART
cana-3401	35	29	graphs	graph	NOUN
cana-3401	35	30	for	for	ADP
cana-3401	35	31	efficiency	efficiency	NOUN
cana-3401	35	32	.	.	PUNCT
cana-3401	36	1	[	[	X
cana-3401	36	2	10	10	NUM
cana-3401	36	3	]	]	PUNCT
cana-3401	36	4	in	in	ADP
cana-3401	36	5	general	general	ADJ
cana-3401	36	6	,	,	PUNCT
cana-3401	36	7	by	by	ADP
cana-3401	36	8	being	be	AUX
cana-3401	36	9	sensitive	sensitive	ADJ
cana-3401	36	10	to	to	ADP
cana-3401	36	11	properties	property	NOUN
cana-3401	36	12	of	of	ADP
cana-3401	36	13	the	the	DET
cana-3401	36	14	graph	graph	NOUN
cana-3401	36	15	that	that	PRON
cana-3401	36	16	the	the	DET
cana-3401	36	17	toyota	toyota	PROPN
cana-3401	36	18	used	use	VERB
cana-3401	36	19	,	,	PUNCT
cana-3401	36	20	these	these	DET
cana-3401	36	21	techniques	technique	NOUN
cana-3401	36	22	aid	aid	NOUN
cana-3401	36	23	in	in	ADP
cana-3401	36	24	arriving	arrive	VERB
cana-3401	36	25	at	at	ADP
cana-3401	36	26	solutions	solution	NOUN
cana-3401	36	27	that	that	PRON
cana-3401	36	28	are	be	AUX
cana-3401	36	29	more	more	ADV
cana-3401	36	30	efficient	efficient	ADJ
cana-3401	36	31	.	.	PUNCT
cana-3401	37	1	this	this	DET
cana-3401	37	2	work	work	NOUN
cana-3401	37	3	extends	extend	VERB
cana-3401	37	4	current	current	ADJ
cana-3401	37	5	research	research	NOUN
cana-3401	37	6	by	by	ADP
cana-3401	37	7	presenting	present	VERB
cana-3401	37	8	new	new	ADJ
cana-3401	37	9	algorithms	algorithm	NOUN
cana-3401	37	10	for	for	ADP
cana-3401	37	11	solving	solve	VERB
cana-3401	37	12	a	a	DET
cana-3401	37	13	complex	complex	ADJ
cana-3401	37	14	and	and	CCONJ
cana-3401	37	15	computationally	computationally	ADV
cana-3401	37	16	intensive	intensive	ADJ
cana-3401	37	17	graph	graph	NOUN
cana-3401	37	18	partitioning	partition	VERB
cana-3401	37	19	problem	problem	NOUN
cana-3401	37	20	in	in	ADP
cana-3401	37	21	graph	graph	NOUN
cana-3401	37	22	theory	theory	NOUN
cana-3401	37	23	with	with	ADP
cana-3401	37	24	its	its	PRON
cana-3401	37	25	applications	application	NOUN
cana-3401	37	26	to	to	ADP
cana-3401	37	27	computationally	computationally	ADV
cana-3401	37	28	intensive	intensive	ADJ
cana-3401	37	29	areas	area	NOUN
cana-3401	37	30	that	that	PRON
cana-3401	37	31	require	require	VERB
cana-3401	37	32	constraint	constraint	NOUN
cana-3401	37	33	aware	aware	ADJ
cana-3401	37	34	graph	graph	NOUN
cana-3401	37	35	partitioning	partition	VERB
cana-3401	37	36	.	.	PUNCT
cana-3401	38	1	fuzzy	fuzzy	ADJ
cana-3401	38	2	graphs	graph	NOUN
cana-3401	38	3	.	.	PUNCT
cana-3401	39	1	a	a	DET
cana-3401	39	2	fuzzy	fuzzy	ADJ
cana-3401	39	3	graph	graph	NOUN
cana-3401	39	4	(	(	PUNCT
cana-3401	39	5	f	f	NOUN
cana-3401	39	6	-	-	PUNCT
cana-3401	39	7	graph	graph	NOUN
cana-3401	39	8	)	)	PUNCT
cana-3401	39	9	is	be	AUX
cana-3401	39	10	a	a	DET
cana-3401	39	11	pair	pair	NOUN
cana-3401	39	12	g	g	NOUN
cana-3401	39	13	:	:	PUNCT
cana-3401	39	14	(	(	PUNCT
cana-3401	39	15	s	s	PROPN
cana-3401	39	16	,	,	PUNCT
cana-3401	39	17	μ	μ	NOUN
cana-3401	39	18	)	)	PUNCT
cana-3401	39	19	where	where	SCONJ
cana-3401	39	20	s	s	NOUN
cana-3401	39	21	is	be	AUX
cana-3401	39	22	a	a	DET
cana-3401	39	23	fuzzy	fuzzy	ADJ
cana-3401	39	24	subset	subset	NOUN
cana-3401	39	25	of	of	ADP
cana-3401	39	26	a	a	DET
cana-3401	39	27	set	set	NOUN
cana-3401	39	28	s	s	NOUN
cana-3401	39	29	and	and	CCONJ
cana-3401	39	30	μ	μ	PROPN
cana-3401	39	31	is	be	AUX
cana-3401	39	32	a	a	DET
cana-3401	39	33	fuzzy	fuzzy	ADJ
cana-3401	39	34	relation	relation	NOUN
cana-3401	39	35	on	on	ADP
cana-3401	39	36	s.	s.	PROPN
cana-3401	39	37	a	a	DET
cana-3401	39	38	fuzzy	fuzzy	ADJ
cana-3401	39	39	graph	graph	NOUN
cana-3401	39	40	h	h	NOUN
cana-3401	39	41	:	:	PUNCT
cana-3401	39	42	(	(	PUNCT
cana-3401	39	43	t	t	PROPN
cana-3401	39	44	,	,	PUNCT
cana-3401	39	45	u	u	NOUN
cana-3401	39	46	)	)	PUNCT
cana-3401	39	47	is	be	AUX
cana-3401	39	48	called	call	VERB
cana-3401	39	49	a	a	DET
cana-3401	39	50	partial	partial	ADJ
cana-3401	39	51	fuzzy	fuzzy	ADJ
cana-3401	39	52	subgraph	subgraph	NOUN
cana-3401	39	53	of	of	ADP
cana-3401	39	54	g	g	NOUN
cana-3401	39	55	:	:	PUNCT
cana-3401	39	56	(	(	PUNCT
cana-3401	39	57	s	s	PROPN
cana-3401	39	58	,	,	PUNCT
cana-3401	39	59	μ	μ	NOUN
cana-3401	39	60	)	)	PUNCT
cana-3401	39	61	if	if	SCONJ
cana-3401	39	62	t	t	PROPN
cana-3401	39	63	(	(	PUNCT
cana-3401	39	64	u	u	NOUN
cana-3401	39	65	)	)	PUNCT
cana-3401	39	66	£	£	PROPN
cana-3401	39	67	s	s	PART
cana-3401	39	68	(	(	PUNCT
cana-3401	39	69	u	u	NOUN
cana-3401	39	70	)	)	PUNCT
cana-3401	39	71	for	for	ADP
cana-3401	39	72	every	every	DET
cana-3401	39	73	u	u	NOUN
cana-3401	39	74	and	and	CCONJ
cana-3401	39	75	u	u	PROPN
cana-3401	39	76	(	(	PUNCT
cana-3401	39	77	u	u	NOUN
cana-3401	39	78	,	,	PUNCT
cana-3401	39	79	v	v	NOUN
cana-3401	39	80	)	)	PUNCT
cana-3401	39	81	£	£	PROPN
cana-3401	39	82	μ	μ	NOUN
cana-3401	39	83	(	(	PUNCT
cana-3401	39	84	u	u	NOUN
cana-3401	39	85	,	,	PUNCT
cana-3401	39	86	v	v	NOUN
cana-3401	39	87	)	)	PUNCT
cana-3401	39	88	for	for	ADP
cana-3401	39	89	every	every	DET
cana-3401	39	90	u	u	NOUN
cana-3401	39	91	and	and	CCONJ
cana-3401	39	92	v	v	NOUN
cana-3401	39	93	.	.	PUNCT
cana-3401	40	1	literature	literature	NOUN
cana-3401	40	2	survey	survey	VERB
cana-3401	40	3	the	the	DET
cana-3401	40	4	notion	notion	NOUN
cana-3401	40	5	of	of	ADP
cana-3401	40	6	fixed	fix	VERB
cana-3401	40	7	-	-	PUNCT
cana-3401	40	8	parameter	parameter	NOUN
cana-3401	40	9	tractability	tractability	NOUN
cana-3401	40	10	has	have	AUX
cana-3401	40	11	developed	develop	VERB
cana-3401	40	12	into	into	ADP
cana-3401	40	13	important	important	ADJ
cana-3401	40	14	notion	notion	NOUN
cana-3401	40	15	in	in	ADP
cana-3401	40	16	the	the	DET
cana-3401	40	17	analysis	analysis	NOUN
cana-3401	40	18	of	of	ADP
cana-3401	40	19	computational	computational	ADJ
cana-3401	40	20	complexity	complexity	NOUN
cana-3401	40	21	,	,	PUNCT
cana-3401	40	22	more	more	ADV
cana-3401	40	23	precisely	precisely	ADV
cana-3401	40	24	in	in	ADP
cana-3401	40	25	problems	problem	NOUN
cana-3401	40	26	related	relate	VERB
cana-3401	40	27	to	to	ADP
cana-3401	40	28	graphs	graph	NOUN
cana-3401	40	29	.	.	PUNCT
cana-3401	41	1	[	[	X
cana-3401	41	2	11	11	NUM
cana-3401	41	3	]	]	PUNCT
cana-3401	41	4	it	it	PRON
cana-3401	41	5	makes	make	VERB
cana-3401	41	6	sense	sense	NOUN
cana-3401	41	7	to	to	PART
cana-3401	41	8	solve	solve	VERB
cana-3401	41	9	problems	problem	NOUN
cana-3401	41	10	using	use	VERB
cana-3401	41	11	fpt	fpt	PROPN
cana-3401	41	12	since	since	SCONJ
cana-3401	41	13	it	it	PRON
cana-3401	41	14	works	work	VERB
cana-3401	41	15	with	with	ADP
cana-3401	41	16	algorithms	algorithm	NOUN
cana-3401	41	17	that	that	PRON
cana-3401	41	18	are	be	AUX
cana-3401	41	19	easy	easy	ADJ
cana-3401	41	20	to	to	PART
cana-3401	41	21	solve	solve	VERB
cana-3401	41	22	,	,	PUNCT
cana-3401	41	23	and	and	CCONJ
cana-3401	41	24	which	which	PRON
cana-3401	41	25	are	be	AUX
cana-3401	41	26	feasible	feasible	ADJ
cana-3401	41	27	for	for	ADP
cana-3401	41	28	large	large	ADJ
cana-3401	41	29	problems	problem	NOUN
cana-3401	41	30	when	when	SCONJ
cana-3401	41	31	parameterized	parameterized	ADJ
cana-3401	41	32	on	on	ADP
cana-3401	41	33	a	a	DET
cana-3401	41	34	certain	certain	ADJ
cana-3401	41	35	parameter	parameter	NOUN
cana-3401	41	36	(	(	PUNCT
cana-3401	41	37	such	such	ADJ
cana-3401	41	38	as	as	ADP
cana-3401	41	39	vertex	vertex	NOUN
cana-3401	41	40	or	or	CCONJ
cana-3401	41	41	edge	edge	NOUN
cana-3401	41	42	)	)	PUNCT
cana-3401	41	43	.	.	PUNCT
cana-3401	42	1	concerning	concern	VERB
cana-3401	42	2	the	the	DET
cana-3401	42	3	application	application	NOUN
cana-3401	42	4	of	of	ADP
cana-3401	42	5	the	the	DET
cana-3401	42	6	fpt	fpt	PROPN
cana-3401	42	7	methods	method	NOUN
cana-3401	42	8	,	,	PUNCT
cana-3401	42	9	the	the	DET
cana-3401	42	10	principles	principle	NOUN
cana-3401	42	11	may	may	AUX
cana-3401	42	12	be	be	AUX
cana-3401	42	13	applied	apply	VERB
cana-3401	42	14	to	to	PART
cana-3401	42	15	solve	solve	VERB
cana-3401	42	16	such	such	ADJ
cana-3401	42	17	problems	problem	NOUN
cana-3401	42	18	as	as	ADP
cana-3401	42	19	the	the	DET
cana-3401	42	20	minimum	minimum	ADJ
cana-3401	42	21	bisection	bisection	NOUN
cana-3401	42	22	problem	problem	NOUN
cana-3401	42	23	in	in	ADP
cana-3401	42	24	the	the	DET
cana-3401	42	25	process	process	NOUN
cana-3401	42	26	of	of	ADP
cana-3401	42	27	graph	graph	NOUN
cana-3401	42	28	partitioning	partition	VERB
cana-3401	42	29	with	with	ADP
cana-3401	42	30	the	the	DET
cana-3401	42	31	help	help	NOUN
cana-3401	42	32	of	of	ADP
cana-3401	42	33	the	the	DET
cana-3401	42	34	applied	apply	VERB
cana-3401	42	35	minimum	minimum	NOUN
cana-3401	42	36	edge	edge	NOUN
cana-3401	42	37	cut	cut	NOUN
cana-3401	42	38	.	.	PUNCT
cana-3401	43	1	cygan	cygan	PROPN
cana-3401	43	2	et	et	PROPN
cana-3401	43	3	al	al	PROPN
cana-3401	43	4	.	.	PROPN
cana-3401	44	1	(	(	PUNCT
cana-3401	44	2	2019	2019	NUM
cana-3401	44	3	)	)	PUNCT
cana-3401	44	4	delivered	deliver	VERB
cana-3401	44	5	critical	critical	ADJ
cana-3401	44	6	information	information	NOUN
cana-3401	44	7	about	about	ADP
cana-3401	44	8	this	this	PRON
cana-3401	44	9	by	by	ADP
cana-3401	44	10	giving	give	VERB
cana-3401	44	11	efficient	efficient	ADJ
cana-3401	44	12	algorithm	algorithm	NOUN
cana-3401	44	13	for	for	ADP
cana-3401	44	14	certain	certain	ADJ
cana-3401	44	15	forms	form	NOUN
cana-3401	44	16	of	of	ADP
cana-3401	44	17	graphs	graph	NOUN
cana-3401	44	18	that	that	PRON
cana-3401	44	19	orientate	orientate	VERB
cana-3401	44	20	the	the	DET
cana-3401	44	21	path	path	NOUN
cana-3401	44	22	towards	towards	ADP
cana-3401	44	23	recognizing	recognize	VERB
cana-3401	44	24	partitioning	partition	VERB
cana-3401	44	25	issues	issue	NOUN
cana-3401	44	26	under	under	ADP
cana-3401	44	27	k	k	PROPN
cana-3401	44	28	seclusion	seclusion	NOUN
cana-3401	44	29	restraints	restraint	NOUN
cana-3401	44	30	.	.	PUNCT
cana-3401	45	1	while	while	SCONJ
cana-3401	45	2	based	base	VERB
cana-3401	45	3	on	on	ADP
cana-3401	45	4	fpt	fpt	PROPN
cana-3401	45	5	approach	approach	NOUN
cana-3401	45	6	,	,	PUNCT
cana-3401	45	7	fpt	fpt	PROPN
cana-3401	45	8	algorithms	algorithm	NOUN
cana-3401	45	9	provide	provide	VERB
cana-3401	45	10	a	a	DET
cana-3401	45	11	valuable	valuable	ADJ
cana-3401	45	12	tool	tool	NOUN
cana-3401	45	13	for	for	ADP
cana-3401	45	14	the	the	DET
cana-3401	45	15	enumeration	enumeration	NOUN
cana-3401	45	16	of	of	ADP
cana-3401	45	17	secluded	secluded	ADJ
cana-3401	45	18	vertex	vertex	NOUN
cana-3401	45	19	sets	set	NOUN
cana-3401	45	20	by	by	ADP
cana-3401	45	21	substantially	substantially	ADV
cana-3401	45	22	reducing	reduce	VERB
cana-3401	45	23	computational	computational	ADJ
cana-3401	45	24	work	work	NOUN
cana-3401	45	25	required	require	VERB
cana-3401	45	26	due	due	ADP
cana-3401	45	27	to	to	ADP
cana-3401	45	28	the	the	DET
cana-3401	45	29	consideration	consideration	NOUN
cana-3401	45	30	of	of	ADP
cana-3401	45	31	specific	specific	ADJ
cana-3401	45	32	graph	graph	NOUN
cana-3401	45	33	characteristics	characteristic	NOUN
cana-3401	45	34	.	.	PUNCT
cana-3401	46	1	in	in	ADP
cana-3401	46	2	this	this	DET
cana-3401	46	3	paper	paper	NOUN
cana-3401	46	4	,	,	PUNCT
cana-3401	46	5	cygan	cygan	PROPN
cana-3401	46	6	et	et	PROPN
cana-3401	46	7	al	al	PROPN
cana-3401	46	8	.	.	PROPN
cana-3401	47	1	(	(	PUNCT
cana-3401	47	2	2021	2021	NUM
cana-3401	47	3	)	)	PUNCT
cana-3401	47	4	furthered	further	VERB
cana-3401	47	5	the	the	DET
cana-3401	47	6	knowledge	knowledge	NOUN
cana-3401	47	7	on	on	ADP
cana-3401	47	8	the	the	DET
cana-3401	47	9	graph	graph	NOUN
cana-3401	47	10	problems	problem	NOUN
cana-3401	47	11	using	use	VERB
cana-3401	47	12	the	the	DET
cana-3401	47	13	randomized	randomized	ADJ
cana-3401	47	14	contraction	contraction	NOUN
cana-3401	47	15	approaches	approach	NOUN
cana-3401	47	16	in	in	ADP
cana-3401	47	17	combination	combination	NOUN
cana-3401	47	18	with	with	ADP
cana-3401	47	19	lean	lean	ADJ
cana-3401	47	20	decomposition	decomposition	NOUN
cana-3401	47	21	.	.	PUNCT
cana-3401	48	1	these	these	DET
cana-3401	48	2	strategies	strategy	NOUN
cana-3401	48	3	are	be	AUX
cana-3401	48	4	especially	especially	ADV
cana-3401	48	5	sensitive	sensitive	ADJ
cana-3401	48	6	when	when	SCONJ
cana-3401	48	7	the	the	DET
cana-3401	48	8	graph	graph	NOUN
cana-3401	48	9	is	be	AUX
cana-3401	48	10	large	large	ADJ
cana-3401	48	11	,	,	PUNCT
cana-3401	48	12	as	as	SCONJ
cana-3401	48	13	they	they	PRON
cana-3401	48	14	offer	offer	VERB
cana-3401	48	15	some	some	DET
cana-3401	48	16	hope	hope	NOUN
cana-3401	48	17	of	of	ADP
cana-3401	48	18	repeatedly	repeatedly	ADV
cana-3401	48	19	shrinking	shrink	VERB
cana-3401	48	20	the	the	DET
cana-3401	48	21	scope	scope	NOUN
cana-3401	48	22	of	of	ADP
cana-3401	48	23	the	the	DET
cana-3401	48	24	problem	problem	NOUN
cana-3401	48	25	without	without	ADP
cana-3401	48	26	losing	lose	VERB
cana-3401	48	27	significant	significant	ADJ
cana-3401	48	28	information	information	NOUN
cana-3401	48	29	in	in	ADP
cana-3401	48	30	the	the	DET
cana-3401	48	31	process	process	NOUN
cana-3401	48	32	.	.	PUNCT
cana-3401	49	1	[	[	X
cana-3401	49	2	12	12	NUM
cana-3401	49	3	]	]	PUNCT
cana-3401	49	4	this	this	DET
cana-3401	49	5	approach	approach	NOUN
cana-3401	49	6	is	be	AUX
cana-3401	49	7	quite	quite	ADV
cana-3401	49	8	important	important	ADJ
cana-3401	49	9	particularly	particularly	ADV
cana-3401	49	10	when	when	SCONJ
cana-3401	49	11	we	we	PRON
cana-3401	49	12	need	need	VERB
cana-3401	49	13	to	to	PART
cana-3401	49	14	configure	configure	VERB
cana-3401	49	15	partitioning	partitioning	NOUN
cana-3401	49	16	of	of	ADP
cana-3401	49	17	k	k	ADJ
cana-3401	49	18	-	-	ADJ
cana-3401	49	19	secluded	secluded	ADJ
cana-3401	49	20	vertices	vertice	VERB
cana-3401	49	21	it	it	PRON
cana-3401	49	22	simplifies	simplify	VERB
cana-3401	49	23	the	the	DET
cana-3401	49	24	graph	graph	NOUN
cana-3401	49	25	and	and	CCONJ
cana-3401	49	26	can	can	AUX
cana-3401	49	27	sometimes	sometimes	ADV
cana-3401	49	28	help	help	VERB
cana-3401	49	29	ensure	ensure	VERB
cana-3401	49	30	that	that	SCONJ
cana-3401	49	31	the	the	DET
cana-3401	49	32	partition	partition	NOUN
cana-3401	49	33	structure	structure	NOUN
cana-3401	49	34	remains	remain	VERB
cana-3401	49	35	undamaged	undamaged	ADJ
cana-3401	49	36	.	.	PUNCT
cana-3401	50	1	randomized	randomize	VERB
cana-3401	50	2	contraction	contraction	NOUN
cana-3401	50	3	techniques	technique	NOUN
cana-3401	50	4	are	be	AUX
cana-3401	50	5	applied	apply	VERB
cana-3401	50	6	to	to	PART
cana-3401	50	7	solve	solve	VERB
cana-3401	50	8	the	the	DET
cana-3401	50	9	problem	problem	NOUN
cana-3401	50	10	by	by	ADP
cana-3401	50	11	gradually	gradually	ADV
cana-3401	50	12	contracting	contract	VERB
cana-3401	50	13	the	the	DET
cana-3401	50	14	graph	graph	NOUN
cana-3401	50	15	such	such	ADJ
cana-3401	50	16	that	that	DET
cana-3401	50	17	computational	computational	ADJ
cana-3401	50	18	requirements	requirement	NOUN
cana-3401	50	19	are	be	AUX
cana-3401	50	20	reduced	reduce	VERB
cana-3401	50	21	while	while	SCONJ
cana-3401	50	22	satisfying	satisfy	VERB
cana-3401	50	23	the	the	DET
cana-3401	50	24	required	require	VERB
cana-3401	50	25	constraints	constraint	NOUN
cana-3401	50	26	such	such	ADJ
cana-3401	50	27	as	as	ADP
cana-3401	50	28	the	the	DET
cana-3401	50	29	induced	induced	ADJ
cana-3401	50	30	subgraph	subgraph	NOUN
cana-3401	50	31	conditions	condition	NOUN
cana-3401	50	32	.	.	PUNCT
cana-3401	51	1	flow	flow	NOUN
cana-3401	51	2	augmentation	augmentation	NOUN
cana-3401	51	3	strategies	strategy	NOUN
cana-3401	51	4	defined	define	VERB
cana-3401	51	5	in	in	ADP
cana-3401	51	6	kim	kim	PROPN
cana-3401	51	7	et	et	PROPN
cana-3401	51	8	al	al	PROPN
cana-3401	51	9	.	.	PROPN
cana-3401	51	10	(	(	PUNCT
cana-3401	51	11	2021	2021	NUM
cana-3401	51	12	)	)	PUNCT
cana-3401	51	13	are	be	AUX
cana-3401	51	14	employed	employ	VERB
cana-3401	51	15	to	to	PART
cana-3401	51	16	improve	improve	VERB
cana-3401	51	17	the	the	DET
cana-3401	51	18	flow	flow	NOUN
cana-3401	51	19	in	in	ADP
cana-3401	51	20	each	each	DET
cana-3401	51	21	graph	graph	NOUN
cana-3401	51	22	by	by	ADP
cana-3401	51	23	increasing	increase	VERB
cana-3401	51	24	capacities	capacity	NOUN
cana-3401	51	25	of	of	ADP
cana-3401	51	26	edges	edge	NOUN
cana-3401	51	27	according	accord	VERB
cana-3401	51	28	to	to	ADP
cana-3401	51	29	the	the	DET
cana-3401	51	30	flow	flow	NOUN
cana-3401	51	31	models	model	NOUN
cana-3401	51	32	.	.	PUNCT
cana-3401	52	1	except	except	SCONJ
cana-3401	52	2	these	these	DET
cana-3401	52	3	techniques	technique	NOUN
cana-3401	52	4	are	be	AUX
cana-3401	52	5	very	very	ADV
cana-3401	52	6	useful	useful	ADJ
cana-3401	52	7	when	when	SCONJ
cana-3401	52	8	solving	solve	VERB
cana-3401	52	9	cut	cut	NOUN
cana-3401	52	10	problems	problem	NOUN
cana-3401	52	11	in	in	ADP
cana-3401	52	12	which	which	PRON
cana-3401	52	13	the	the	DET
cana-3401	52	14	purpose	purpose	NOUN
cana-3401	52	15	tries	try	VERB
cana-3401	52	16	to	to	PART
cana-3401	52	17	return	return	VERB
cana-3401	52	18	the	the	DET
cana-3401	52	19	minimum	minimum	ADJ
cana-3401	52	20	cut	cut	NOUN
cana-3401	52	21	in	in	ADP
cana-3401	52	22	a	a	DET
cana-3401	52	23	graph	graph	NOUN
cana-3401	52	24	to	to	ADP
cana-3401	52	25	a	a	DET
cana-3401	52	26	set	set	NOUN
cana-3401	52	27	of	of	ADP
cana-3401	52	28	constraints	constraint	NOUN
cana-3401	52	29	in	in	ADP
cana-3401	52	30	vertices	vertex	NOUN
cana-3401	52	31	or	or	CCONJ
cana-3401	52	32	edges	edge	NOUN
cana-3401	52	33	.	.	PUNCT
cana-3401	53	1	with	with	ADP
cana-3401	53	2	respect	respect	NOUN
cana-3401	53	3	to	to	ADP
cana-3401	53	4	k	k	ADJ
cana-3401	53	5	-	-	ADJ
cana-3401	53	6	secluded	secluded	ADJ
cana-3401	53	7	vertex	vertex	NOUN
cana-3401	53	8	sets	set	NOUN
cana-3401	53	9	,	,	PUNCT
cana-3401	53	10	flow	flow	NOUN
cana-3401	53	11	-	-	PUNCT
cana-3401	53	12	augmentation	augmentation	NOUN
cana-3401	53	13	techniques	technique	NOUN
cana-3401	53	14	can	can	AUX
cana-3401	53	15	be	be	AUX
cana-3401	53	16	applied	apply	VERB
cana-3401	53	17	to	to	PART
cana-3401	53	18	find	find	VERB
cana-3401	53	19	partitions	partition	NOUN
cana-3401	53	20	of	of	ADP
cana-3401	53	21	the	the	DET
cana-3401	53	22	graph	graph	NOUN
cana-3401	53	23	such	such	ADJ
cana-3401	53	24	that	that	SCONJ
cana-3401	53	25	the	the	DET
cana-3401	53	26	seclusion	seclusion	NOUN
cana-3401	53	27	conditions	condition	NOUN
cana-3401	53	28	are	be	AUX
cana-3401	53	29	preserved	preserve	VERB
cana-3401	53	30	,	,	PUNCT
cana-3401	53	31	as	as	ADV
cana-3401	53	32	well	well	ADV
cana-3401	53	33	as	as	ADP
cana-3401	53	34	the	the	DET
cana-3401	53	35	generated	generate	VERB
cana-3401	53	36	subgraph	subgraph	NOUN
cana-3401	53	37	does	do	AUX
cana-3401	53	38	not	not	PART
cana-3401	53	39	contain	contain	VERB
cana-3401	53	40	some	some	DET
cana-3401	53	41	forbidden	forbid	VERB
cana-3401	53	42	constructions	construction	NOUN
cana-3401	53	43	.	.	PUNCT
cana-3401	54	1	this	this	PRON
cana-3401	54	2	is	be	AUX
cana-3401	54	3	especially	especially	ADV
cana-3401	54	4	the	the	DET
cana-3401	54	5	case	case	NOUN
cana-3401	54	6	when	when	SCONJ
cana-3401	54	7	edges	edge	NOUN
cana-3401	54	8	may	may	AUX
cana-3401	54	9	be	be	AUX
cana-3401	54	10	directed	direct	VERB
cana-3401	54	11	or	or	CCONJ
cana-3401	54	12	when	when	SCONJ
cana-3401	54	13	the	the	DET
cana-3401	54	14	graph	graph	NOUN
cana-3401	54	15	might	might	AUX
cana-3401	54	16	have	have	VERB
cana-3401	54	17	other	other	ADJ
cana-3401	54	18	constrains	constrain	NOUN
cana-3401	54	19	as	as	ADP
cana-3401	54	20	to	to	ADP
cana-3401	54	21	the	the	DET
cana-3401	54	22	flow	flow	NOUN
cana-3401	54	23	across	across	ADP
cana-3401	54	24	parts	part	NOUN
cana-3401	54	25	in	in	ADP
cana-3401	54	26	the	the	DET
cana-3401	54	27	partition	partition	NOUN
cana-3401	54	28	,	,	PUNCT
cana-3401	54	29	mentioned	mention	VERB
cana-3401	54	30	in	in	ADP
cana-3401	54	31	kim	kim	PROPN
cana-3401	54	32	et	et	PROPN
cana-3401	54	33	al	al	PROPN
cana-3401	54	34	.	.	PROPN
cana-3401	55	1	(	(	PUNCT
cana-3401	55	2	2022	2022	NUM
cana-3401	55	3	)	)	PUNCT
cana-3401	55	4	who	who	PRON
cana-3401	55	5	considered	consider	VERB
cana-3401	55	6	directed	directed	ADJ
cana-3401	55	7	graphs	graph	NOUN
cana-3401	55	8	.	.	PUNCT
cana-3401	56	1	seclusion	seclusion	NOUN
cana-3401	56	2	constraints	constraint	NOUN
cana-3401	56	3	are	be	AUX
cana-3401	56	4	critical	critical	ADJ
cana-3401	56	5	in	in	ADP
cana-3401	56	6	graph	graph	NOUN
cana-3401	56	7	theory	theory	NOUN
cana-3401	56	8	and	and	CCONJ
cana-3401	56	9	especially	especially	ADV
cana-3401	56	10	when	when	SCONJ
cana-3401	56	11	identifying	identify	VERB
cana-3401	56	12	concerns	concern	NOUN
cana-3401	56	13	regarding	regard	VERB
cana-3401	56	14	communications	communication	NOUN
cana-3401	56	15	on	on	ADP
cana-3401	56	16	applied	apply	VERB
cana-3401	56	17	nonlinear	nonlinear	ADJ
cana-3401	56	18	analysis	analysis	NOUN
cana-3401	56	19	issn	issn	NOUN
cana-3401	56	20	:	:	PUNCT
cana-3401	56	21	1074	1074	NUM
cana-3401	56	22	-	-	PUNCT
cana-3401	56	23	133x	133x	NUM
cana-3401	56	24	vol	vol	NOUN
cana-3401	56	25	32	32	NUM
cana-3401	56	26	no	no	NOUN
cana-3401	56	27	.	.	PUNCT
cana-3401	57	1	7s	7	NOUN
cana-3401	57	2	(	(	PUNCT
cana-3401	57	3	2025	2025	NUM
cana-3401	57	4	)	)	PUNCT
cana-3401	57	5	299	299	NUM
cana-3401	57	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	57	7	privacy	privacy	NOUN
cana-3401	57	8	and	and	CCONJ
cana-3401	57	9	networks	network	NOUN
cana-3401	57	10	within	within	ADP
cana-3401	57	11	the	the	DET
cana-3401	57	12	same	same	ADJ
cana-3401	57	13	.	.	PUNCT
cana-3401	58	1	we	we	PRON
cana-3401	58	2	further	far	ADV
cana-3401	58	3	consider	consider	VERB
cana-3401	58	4	the	the	DET
cana-3401	58	5	work	work	NOUN
cana-3401	58	6	of	of	ADP
cana-3401	58	7	bevern	bevern	NOUN
cana-3401	58	8	et	et	PROPN
cana-3401	58	9	al	al	PROPN
cana-3401	58	10	.	.	PROPN
cana-3401	59	1	(	(	PUNCT
cana-3401	59	2	2020	2020	NUM
cana-3401	59	3	)	)	PUNCT
cana-3401	59	4	that	that	PRON
cana-3401	59	5	analysed	analyse	VERB
cana-3401	59	6	secluded	secluded	ADJ
cana-3401	59	7	paths	path	NOUN
cana-3401	59	8	which	which	PRON
cana-3401	59	9	is	be	AUX
cana-3401	59	10	the	the	DET
cana-3401	59	11	paths	path	NOUN
cana-3401	59	12	that	that	PRON
cana-3401	59	13	fulfil	fulfil	VERB
cana-3401	59	14	certain	certain	ADJ
cana-3401	59	15	constraints	constraint	NOUN
cana-3401	59	16	including	include	VERB
cana-3401	59	17	minimum	minimum	ADJ
cana-3401	59	18	distance	distance	NOUN
cana-3401	59	19	from	from	ADP
cana-3401	59	20	other	other	ADJ
cana-3401	59	21	paths	path	NOUN
cana-3401	59	22	or	or	CCONJ
cana-3401	59	23	vertices	vertex	NOUN
cana-3401	59	24	.	.	PUNCT
cana-3401	60	1	this	this	PRON
cana-3401	60	2	comes	come	VERB
cana-3401	60	3	handy	handy	ADJ
cana-3401	60	4	when	when	SCONJ
cana-3401	60	5	designing	design	VERB
cana-3401	60	6	privacy	privacy	NOUN
cana-3401	60	7	-	-	PUNCT
cana-3401	60	8	preserving	preserve	VERB
cana-3401	60	9	graph	graph	NOUN
cana-3401	60	10	applications	application	NOUN
cana-3401	60	11	,	,	PUNCT
cana-3401	60	12	where	where	SCONJ
cana-3401	60	13	specific	specific	ADJ
cana-3401	60	14	vertices	vertex	NOUN
cana-3401	60	15	,	,	PUNCT
cana-3401	60	16	or	or	CCONJ
cana-3401	60	17	paths	path	NOUN
cana-3401	60	18	in	in	ADP
cana-3401	60	19	the	the	DET
cana-3401	60	20	graph	graph	NOUN
cana-3401	60	21	,	,	PUNCT
cana-3401	60	22	are	be	AUX
cana-3401	60	23	to	to	PART
cana-3401	60	24	be	be	AUX
cana-3401	60	25	isolated	isolate	VERB
cana-3401	60	26	to	to	PART
cana-3401	60	27	prohibit	prohibit	VERB
cana-3401	60	28	data	datum	NOUN
cana-3401	60	29	leakage	leakage	NOUN
cana-3401	60	30	.	.	PUNCT
cana-3401	61	1	building	build	VERB
cana-3401	61	2	on	on	ADP
cana-3401	61	3	this	this	PRON
cana-3401	61	4	,	,	PUNCT
cana-3401	61	5	luckow	luckow	NOUN
cana-3401	61	6	and	and	CCONJ
cana-3401	61	7	fluschnik	fluschnik	NOUN
cana-3401	61	8	(	(	PUNCT
cana-3401	61	9	2020	2020	NUM
cana-3401	61	10	)	)	PUNCT
cana-3401	61	11	looked	look	VERB
cana-3401	61	12	at	at	ADP
cana-3401	61	13	neighborhoodconstrained	neighborhoodconstraine	VERB
cana-3401	61	14	path	path	NOUN
cana-3401	61	15	problems	problem	NOUN
cana-3401	61	16	which	which	PRON
cana-3401	61	17	desist	desist	VERB
cana-3401	61	18	from	from	ADP
cana-3401	61	19	exploring	explore	VERB
cana-3401	61	20	a	a	DET
cana-3401	61	21	large	large	ADJ
cana-3401	61	22	neighborhood	neighborhood	NOUN
cana-3401	61	23	around	around	ADP
cana-3401	61	24	each	each	DET
cana-3401	61	25	vertex	vertex	NOUN
cana-3401	61	26	.	.	PUNCT
cana-3401	62	1	while	while	SCONJ
cana-3401	62	2	these	these	DET
cana-3401	62	3	seclusion	seclusion	NOUN
cana-3401	62	4	constraints	constraint	NOUN
cana-3401	62	5	enforce	enforce	VERB
cana-3401	62	6	the	the	DET
cana-3401	62	7	structured	structured	ADJ
cana-3401	62	8	couple	couple	NOUN
cana-3401	62	9	of	of	ADP
cana-3401	62	10	the	the	DET
cana-3401	62	11	graph	graph	NOUN
cana-3401	62	12	,	,	PUNCT
cana-3401	62	13	they	they	PRON
cana-3401	62	14	can	can	AUX
cana-3401	62	15	also	also	ADV
cana-3401	62	16	be	be	AUX
cana-3401	62	17	used	use	VERB
cana-3401	62	18	to	to	PART
cana-3401	62	19	seclude	seclude	VERB
cana-3401	62	20	specific	specific	ADJ
cana-3401	62	21	sections	section	NOUN
cana-3401	62	22	of	of	ADP
cana-3401	62	23	the	the	DET
cana-3401	62	24	graph	graph	NOUN
cana-3401	62	25	from	from	ADP
cana-3401	62	26	others	other	NOUN
cana-3401	62	27	.	.	PUNCT
cana-3401	63	1	in	in	ADP
cana-3401	63	2	the	the	DET
cana-3401	63	3	setting	setting	NOUN
cana-3401	63	4	of	of	ADP
cana-3401	63	5	graph	graph	NOUN
cana-3401	63	6	partitioning	partition	VERB
cana-3401	63	7	with	with	ADP
cana-3401	63	8	forbidden	forbid	VERB
cana-3401	63	9	subgraph	subgraph	NOUN
cana-3401	63	10	constraints	constraint	NOUN
cana-3401	63	11	these	these	DET
cana-3401	63	12	seclusion	seclusion	NOUN
cana-3401	63	13	strategies	strategy	NOUN
cana-3401	63	14	are	be	AUX
cana-3401	63	15	important	important	ADJ
cana-3401	63	16	for	for	ADP
cana-3401	63	17	preserving	preserve	VERB
cana-3401	63	18	the	the	DET
cana-3401	63	19	integrity	integrity	NOUN
cana-3401	63	20	of	of	ADP
cana-3401	63	21	the	the	DET
cana-3401	63	22	partitions	partition	NOUN
cana-3401	63	23	as	as	ADV
cana-3401	63	24	well	well	ADV
cana-3401	63	25	as	as	ADP
cana-3401	63	26	excluding	exclude	VERB
cana-3401	63	27	certain	certain	ADJ
cana-3401	63	28	setups	setup	NOUN
cana-3401	63	29	.	.	PUNCT
cana-3401	64	1	kernelization	kernelization	NOUN
cana-3401	64	2	,	,	PUNCT
cana-3401	64	3	discussed	discuss	VERB
cana-3401	64	4	by	by	ADP
cana-3401	64	5	kratsch	kratsch	NOUN
cana-3401	64	6	and	and	CCONJ
cana-3401	64	7	wahlstrom	wahlstrom	NOUN
cana-3401	64	8	(	(	PUNCT
cana-3401	64	9	2020	2020	NUM
cana-3401	64	10	)	)	PUNCT
cana-3401	64	11	refers	refer	VERB
cana-3401	64	12	to	to	ADP
cana-3401	64	13	a	a	DET
cana-3401	64	14	technique	technique	NOUN
cana-3401	64	15	of	of	ADP
cana-3401	64	16	preprocessing	preprocessing	NOUN
cana-3401	64	17	that	that	PRON
cana-3401	64	18	aims	aim	VERB
cana-3401	64	19	at	at	ADP
cana-3401	64	20	solving	solve	VERB
cana-3401	64	21	a	a	DET
cana-3401	64	22	simplified	simplified	ADJ
cana-3401	64	23	version	version	NOUN
cana-3401	64	24	of	of	ADP
cana-3401	64	25	a	a	DET
cana-3401	64	26	problem	problem	NOUN
cana-3401	64	27	that	that	PRON
cana-3401	64	28	captures	capture	VERB
cana-3401	64	29	the	the	DET
cana-3401	64	30	necessary	necessary	ADJ
cana-3401	64	31	information	information	NOUN
cana-3401	64	32	in	in	ADP
cana-3401	64	33	smaller	small	ADJ
cana-3401	64	34	form	form	NOUN
cana-3401	64	35	.	.	PUNCT
cana-3401	65	1	kernelization	kernelization	NOUN
cana-3401	65	2	consequently	consequently	ADV
cana-3401	65	3	provides	provide	VERB
cana-3401	65	4	a	a	DET
cana-3401	65	5	method	method	NOUN
cana-3401	65	6	to	to	PART
cana-3401	65	7	describe	describe	VERB
cana-3401	65	8	with	with	ADP
cana-3401	65	9	regards	regard	NOUN
cana-3401	65	10	to	to	ADP
cana-3401	65	11	graphs	graph	NOUN
cana-3401	65	12	in	in	ADP
cana-3401	65	13	such	such	DET
cana-3401	65	14	a	a	DET
cana-3401	65	15	way	way	NOUN
cana-3401	65	16	that	that	PRON
cana-3401	65	17	the	the	DET
cana-3401	65	18	calculations	calculation	NOUN
cana-3401	65	19	become	become	VERB
cana-3401	65	20	more	more	ADV
cana-3401	65	21	efficient	efficient	ADJ
cana-3401	65	22	by	by	ADP
cana-3401	65	23	marking	mark	VERB
cana-3401	65	24	certain	certain	ADJ
cana-3401	65	25	vertices	vertex	NOUN
cana-3401	65	26	or	or	CCONJ
cana-3401	65	27	pieces	piece	NOUN
cana-3401	65	28	of	of	ADP
cana-3401	65	29	the	the	DET
cana-3401	65	30	graph	graph	NOUN
cana-3401	65	31	as	as	ADV
cana-3401	65	32	redundant	redundant	ADJ
cana-3401	65	33	.	.	PUNCT
cana-3401	66	1	thus	thus	ADV
cana-3401	66	2	,	,	PUNCT
cana-3401	66	3	kernelization	kernelization	NOUN
cana-3401	66	4	can	can	AUX
cana-3401	66	5	be	be	AUX
cana-3401	66	6	applied	apply	VERB
cana-3401	66	7	to	to	ADP
cana-3401	66	8	vertex	vertex	NOUN
cana-3401	66	9	sets	set	NOUN
cana-3401	66	10	that	that	PRON
cana-3401	66	11	are	be	AUX
cana-3401	66	12	k	k	ADV
cana-3401	66	13	-	-	VERB
cana-3401	66	14	separated	separate	VERB
cana-3401	66	15	,	,	PUNCT
cana-3401	66	16	to	to	PART
cana-3401	66	17	remove	remove	VERB
cana-3401	66	18	certain	certain	ADJ
cana-3401	66	19	parts	part	NOUN
cana-3401	66	20	of	of	ADP
cana-3401	66	21	the	the	DET
cana-3401	66	22	graph	graph	NOUN
cana-3401	66	23	that	that	PRON
cana-3401	66	24	do	do	AUX
cana-3401	66	25	not	not	PART
cana-3401	66	26	affect	affect	VERB
cana-3401	66	27	the	the	DET
cana-3401	66	28	solution	solution	NOUN
cana-3401	66	29	,	,	PUNCT
cana-3401	66	30	or	or	CCONJ
cana-3401	66	31	the	the	DET
cana-3401	66	32	constraints	constraint	NOUN
cana-3401	66	33	put	put	VERB
cana-3401	66	34	on	on	ADP
cana-3401	66	35	the	the	DET
cana-3401	66	36	vertex	vertex	NOUN
cana-3401	66	37	set	set	NOUN
cana-3401	66	38	.	.	PUNCT
cana-3401	67	1	this	this	PRON
cana-3401	67	2	is	be	AUX
cana-3401	67	3	especially	especially	ADV
cana-3401	67	4	helpful	helpful	ADJ
cana-3401	67	5	when	when	SCONJ
cana-3401	67	6	handling	handle	VERB
cana-3401	67	7	large	large	ADJ
cana-3401	67	8	graphs	graph	NOUN
cana-3401	67	9	since	since	SCONJ
cana-3401	67	10	the	the	DET
cana-3401	67	11	size	size	NOUN
cana-3401	67	12	of	of	ADP
cana-3401	67	13	the	the	DET
cana-3401	67	14	input	input	NOUN
cana-3401	67	15	graph	graph	NOUN
cana-3401	67	16	puts	put	VERB
cana-3401	67	17	the	the	DET
cana-3401	67	18	algorithm	algorithm	NOUN
cana-3401	67	19	at	at	ADP
cana-3401	67	20	risk	risk	NOUN
cana-3401	67	21	of	of	ADP
cana-3401	67	22	unacceptably	unacceptably	ADV
cana-3401	67	23	high	high	ADJ
cana-3401	67	24	computation	computation	NOUN
cana-3401	67	25	time	time	NOUN
cana-3401	67	26	.	.	PUNCT
cana-3401	68	1	kernelization	kernelization	NOUN
cana-3401	68	2	assists	assist	VERB
cana-3401	68	3	in	in	ADP
cana-3401	68	4	making	make	VERB
cana-3401	68	5	the	the	DET
cana-3401	68	6	graph	graph	NOUN
cana-3401	68	7	manageable	manageable	ADJ
cana-3401	68	8	in	in	ADP
cana-3401	68	9	terms	term	NOUN
cana-3401	68	10	of	of	ADP
cana-3401	68	11	reducing	reduce	VERB
cana-3401	68	12	the	the	DET
cana-3401	68	13	number	number	NOUN
cana-3401	68	14	of	of	ADP
cana-3401	68	15	possibilities	possibility	NOUN
cana-3401	68	16	that	that	PRON
cana-3401	68	17	one	one	PRON
cana-3401	68	18	has	have	AUX
cana-3401	68	19	subjected	subject	VERB
cana-3401	68	20	to	to	ADP
cana-3401	68	21	the	the	DET
cana-3401	68	22	constraints	constraint	NOUN
cana-3401	68	23	as	as	SCONJ
cana-3401	68	24	specified	specify	VERB
cana-3401	68	25	to	to	PART
cana-3401	68	26	enumerate	enumerate	VERB
cana-3401	68	27	valid	valid	ADJ
cana-3401	68	28	k	k	ADJ
cana-3401	68	29	-	-	ADJ
cana-3401	68	30	secluded	secluded	ADJ
cana-3401	68	31	vertex	vertex	NOUN
cana-3401	68	32	sets	set	NOUN
cana-3401	68	33	.	.	PUNCT
cana-3401	69	1	in	in	ADP
cana-3401	69	2	the	the	DET
cana-3401	69	3	analysis	analysis	NOUN
cana-3401	69	4	of	of	ADP
cana-3401	69	5	secluded	secluded	ADJ
cana-3401	69	6	graph	graph	NOUN
cana-3401	69	7	structures	structure	NOUN
cana-3401	69	8	,	,	PUNCT
cana-3401	69	9	a	a	DET
cana-3401	69	10	tough	tough	ADJ
cana-3401	69	11	research	research	NOUN
cana-3401	69	12	question	question	NOUN
cana-3401	69	13	under	under	ADP
cana-3401	69	14	investigation	investigation	NOUN
cana-3401	69	15	is	be	AUX
cana-3401	69	16	that	that	PRON
cana-3401	69	17	of	of	ADP
cana-3401	69	18	k	k	PROPN
cana-3401	69	19	secluded	secluded	ADJ
cana-3401	69	20	trees	tree	NOUN
cana-3401	69	21	,	,	PUNCT
cana-3401	69	22	by	by	ADP
cana-3401	69	23	donkers	donker	NOUN
cana-3401	69	24	et	et	PROPN
cana-3401	69	25	al	al	PROPN
cana-3401	69	26	.	.	PROPN
cana-3401	70	1	(	(	PUNCT
cana-3401	70	2	2023	2023	NUM
cana-3401	70	3	)	)	PUNCT
cana-3401	70	4	.	.	PUNCT
cana-3401	71	1	k	k	X
cana-3401	71	2	-	-	ADJ
cana-3401	71	3	secluded	secluded	ADJ
cana-3401	71	4	trees	tree	NOUN
cana-3401	71	5	are	be	AUX
cana-3401	71	6	subgraphs	subgraph	NOUN
cana-3401	71	7	in	in	ADP
cana-3401	71	8	which	which	PRON
cana-3401	71	9	its	its	PRON
cana-3401	71	10	vertices	vertex	NOUN
cana-3401	71	11	are	be	AUX
cana-3401	71	12	separated	separate	VERB
cana-3401	71	13	from	from	ADP
cana-3401	71	14	the	the	DET
cana-3401	71	15	other	other	ADJ
cana-3401	71	16	part	part	NOUN
cana-3401	71	17	of	of	ADP
cana-3401	71	18	the	the	DET
cana-3401	71	19	graph	graph	NOUN
cana-3401	71	20	by	by	ADP
cana-3401	71	21	at	at	ADV
cana-3401	71	22	least	least	ADJ
cana-3401	71	23	‘	'	PUNCT
cana-3401	71	24	k	k	NOUN
cana-3401	71	25	’	'	PUNCT
cana-3401	71	26	distance	distance	NOUN
cana-3401	71	27	.	.	PUNCT
cana-3401	72	1	finding	find	VERB
cana-3401	72	2	such	such	ADJ
cana-3401	72	3	trees	tree	NOUN
cana-3401	72	4	quickly	quickly	ADV
cana-3401	72	5	becomes	become	VERB
cana-3401	72	6	critical	critical	ADJ
cana-3401	72	7	to	to	ADP
cana-3401	72	8	any	any	DET
cana-3401	72	9	graph	graph	NOUN
cana-3401	72	10	partitioning	partition	VERB
cana-3401	72	11	application	application	NOUN
cana-3401	72	12	since	since	SCONJ
cana-3401	72	13	they	they	PRON
cana-3401	72	14	guarantee	guarantee	VERB
cana-3401	72	15	that	that	SCONJ
cana-3401	72	16	the	the	DET
cana-3401	72	17	resulting	result	VERB
cana-3401	72	18	subgraphs	subgraph	NOUN
cana-3401	72	19	are	be	AUX
cana-3401	72	20	sufficiently	sufficiently	ADV
cana-3401	72	21	isolated	isolate	VERB
cana-3401	72	22	.	.	PUNCT
cana-3401	73	1	further	far	ADV
cana-3401	73	2	,	,	PUNCT
cana-3401	73	3	golovach	golovach	VERB
cana-3401	73	4	et	et	NOUN
cana-3401	73	5	al	al	PROPN
cana-3401	73	6	.	.	PROPN
cana-3401	74	1	(	(	PUNCT
cana-3401	74	2	2020	2020	NUM
cana-3401	74	3	)	)	PUNCT
cana-3401	74	4	move	move	NOUN
cana-3401	74	5	towards	towards	ADP
cana-3401	74	6	this	this	DET
cana-3401	74	7	direction	direction	NOUN
cana-3401	74	8	by	by	ADP
cana-3401	74	9	studying	study	VERB
cana-3401	74	10	the	the	DET
cana-3401	74	11	problem	problem	NOUN
cana-3401	74	12	of	of	ADP
cana-3401	74	13	computing	compute	VERB
cana-3401	74	14	all	all	PRON
cana-3401	74	15	connected	connect	VERB
cana-3401	74	16	se	se	X
cana-3401	74	17	eluded	elude	VERB
cana-3401	74	18	subgraphs	subgraph	NOUN
cana-3401	74	19	in	in	ADP
cana-3401	74	20	which	which	PRON
cana-3401	74	21	connectivity	connectivity	NOUN
cana-3401	74	22	is	be	AUX
cana-3401	74	23	tract	tract	NOUN
cana-3401	74	24	preserved	preserve	VERB
cana-3401	74	25	al	al	PROPN
cana-3401	74	26	moreover	moreover	ADV
cana-3401	74	27	,	,	PUNCT
cana-3401	74	28	national	national	PROPN
cana-3401	74	29	se	se	PROPN
cana-3401	74	30	eluded	elude	VERB
cana-3401	74	31	subgraphs	subgraph	NOUN
cana-3401	74	32	where	where	SCONJ
cana-3401	74	33	only	only	ADV
cana-3401	74	34	the	the	DET
cana-3401	74	35	connectivity	connectivity	NOUN
cana-3401	74	36	of	of	ADP
cana-3401	74	37	the	the	DET
cana-3401	74	38	subgraphs	subgraph	NOUN
cana-3401	74	39	must	must	AUX
cana-3401	74	40	be	be	AUX
cana-3401	74	41	preserved	preserve	VERB
cana-3401	74	42	.	.	PUNCT
cana-3401	75	1	this	this	DET
cana-3401	75	2	paper	paper	NOUN
cana-3401	75	3	bears	bear	VERB
cana-3401	75	4	strong	strong	ADJ
cana-3401	75	5	connection	connection	NOUN
cana-3401	75	6	with	with	ADP
cana-3401	75	7	the	the	DET
cana-3401	75	8	problem	problem	NOUN
cana-3401	75	9	of	of	ADP
cana-3401	75	10	identifying	identify	VERB
cana-3401	75	11	the	the	DET
cana-3401	75	12	valid	valid	ADJ
cana-3401	75	13	vertex	vertex	NOUN
cana-3401	75	14	sets	set	NOUN
cana-3401	75	15	that	that	PRON
cana-3401	75	16	meet	meet	VERB
cana-3401	75	17	the	the	DET
cana-3401	75	18	requirements	requirement	NOUN
cana-3401	75	19	of	of	ADP
cana-3401	75	20	k	k	NOUN
cana-3401	75	21	-	-	NOUN
cana-3401	75	22	seclusion	seclusion	NOUN
cana-3401	75	23	and	and	CCONJ
cana-3401	75	24	forbidden	forbid	VERB
cana-3401	75	25	subgraphs	subgraph	NOUN
cana-3401	75	26	do	do	AUX
cana-3401	75	27	not	not	PART
cana-3401	75	28	exist	exist	VERB
cana-3401	75	29	in	in	ADP
cana-3401	75	30	partitioning	partition	VERB
cana-3401	75	31	generated	generate	VERB
cana-3401	75	32	subgraphs	subgraph	NOUN
cana-3401	75	33	.	.	PUNCT
cana-3401	76	1	in	in	ADP
cana-3401	76	2	jacob	jacob	PROPN
cana-3401	76	3	et	et	PROPN
cana-3401	76	4	al	al	PROPN
cana-3401	76	5	.	.	PROPN
cana-3401	77	1	(	(	PUNCT
cana-3401	77	2	2023	2023	NUM
cana-3401	77	3	)	)	PUNCT
cana-3401	77	4	,	,	PUNCT
cana-3401	77	5	focused	focus	VERB
cana-3401	77	6	is	be	AUX
cana-3401	77	7	made	make	VERB
cana-3401	77	8	on	on	ADP
cana-3401	77	9	deletion	deletion	NOUN
cana-3401	77	10	problems	problem	NOUN
cana-3401	77	11	for	for	ADP
cana-3401	77	12	scattered	scatter	VERB
cana-3401	77	13	graph	graph	NOUN
cana-3401	77	14	classes	class	NOUN
cana-3401	77	15	and	and	CCONJ
cana-3401	77	16	this	this	PRON
cana-3401	77	17	is	be	AUX
cana-3401	77	18	considered	consider	VERB
cana-3401	77	19	as	as	ADP
cana-3401	77	20	the	the	DET
cana-3401	77	21	case	case	NOUN
cana-3401	77	22	where	where	SCONJ
cana-3401	77	23	some	some	DET
cana-3401	77	24	vertices	vertex	NOUN
cana-3401	77	25	/	/	SYM
cana-3401	77	26	edges	edge	NOUN
cana-3401	77	27	must	must	AUX
cana-3401	77	28	be	be	AUX
cana-3401	77	29	deleted	delete	VERB
cana-3401	77	30	to	to	PART
cana-3401	77	31	obtain	obtain	VERB
cana-3401	77	32	a	a	DET
cana-3401	77	33	certain	certain	ADJ
cana-3401	77	34	graph	graph	NOUN
cana-3401	77	35	.	.	PUNCT
cana-3401	78	1	in	in	ADP
cana-3401	78	2	graph	graph	NOUN
cana-3401	78	3	partitioning	partition	VERB
cana-3401	78	4	this	this	PRON
cana-3401	78	5	is	be	AUX
cana-3401	78	6	used	use	VERB
cana-3401	78	7	in	in	ADP
cana-3401	78	8	a	a	DET
cana-3401	78	9	such	such	ADJ
cana-3401	78	10	way	way	NOUN
cana-3401	78	11	that	that	SCONJ
cana-3401	78	12	a	a	DET
cana-3401	78	13	change	change	NOUN
cana-3401	78	14	is	be	AUX
cana-3401	78	15	performed	perform	VERB
cana-3401	78	16	to	to	ADP
cana-3401	78	17	a	a	DET
cana-3401	78	18	given	give	VERB
cana-3401	78	19	graph	graph	NOUN
cana-3401	78	20	so	so	SCONJ
cana-3401	78	21	as	as	SCONJ
cana-3401	78	22	the	the	DET
cana-3401	78	23	resulting	result	VERB
cana-3401	78	24	are	be	AUX
cana-3401	78	25	within	within	ADP
cana-3401	78	26	a	a	DET
cana-3401	78	27	fixed	fix	VERB
cana-3401	78	28	partitioning	partitioning	NOUN
cana-3401	78	29	parameter	parameter	NOUN
cana-3401	78	30	.	.	PUNCT
cana-3401	79	1	forbidden	forbid	VERB
cana-3401	79	2	subgraph	subgraph	NOUN
cana-3401	79	3	constraints	constraint	NOUN
cana-3401	79	4	require	require	VERB
cana-3401	79	5	deletion	deletion	NOUN
cana-3401	79	6	problems	problem	NOUN
cana-3401	79	7	because	because	SCONJ
cana-3401	79	8	it	it	PRON
cana-3401	79	9	is	be	AUX
cana-3401	79	10	possible	possible	ADJ
cana-3401	79	11	to	to	PART
cana-3401	79	12	remove	remove	VERB
cana-3401	79	13	several	several	ADJ
cana-3401	79	14	vertices	vertex	NOUN
cana-3401	79	15	or	or	CCONJ
cana-3401	79	16	edges	edge	NOUN
cana-3401	79	17	to	to	PART
cana-3401	79	18	avoid	avoid	VERB
cana-3401	79	19	making	make	VERB
cana-3401	79	20	structures	structure	NOUN
cana-3401	79	21	forbidden	forbid	VERB
cana-3401	79	22	.	.	PUNCT
cana-3401	80	1	incorporating	incorporate	VERB
cana-3401	80	2	constraint	constraint	NOUN
cana-3401	80	3	into	into	ADP
cana-3401	80	4	fpt	fpt	PROPN
cana-3401	80	5	algorithms	algorithm	NOUN
cana-3401	80	6	for	for	ADP
cana-3401	80	7	deletion	deletion	NOUN
cana-3401	80	8	problems	problem	NOUN
cana-3401	80	9	is	be	AUX
cana-3401	80	10	a	a	DET
cana-3401	80	11	good	good	ADJ
cana-3401	80	12	starting	starting	NOUN
cana-3401	80	13	point	point	NOUN
cana-3401	80	14	in	in	ADP
cana-3401	80	15	address	address	NOUN
cana-3401	80	16	jacob	jacob	PROPN
cana-3401	80	17	and	and	CCONJ
cana-3401	80	18	his	his	PRON
cana-3401	80	19	team	team	NOUN
cana-3401	80	20	work	work	VERB
cana-3401	80	21	.	.	PUNCT
cana-3401	81	1	another	another	DET
cana-3401	81	2	study	study	NOUN
cana-3401	81	3	,	,	PUNCT
cana-3401	81	4	multi	multi	ADJ
cana-3401	81	5	-	-	ADJ
cana-3401	81	6	class	class	ADJ
cana-3401	81	7	deletions	deletion	NOUN
cana-3401	81	8	,	,	PUNCT
cana-3401	81	9	adds	add	VERB
cana-3401	81	10	more	more	ADJ
cana-3401	81	11	detail	detail	NOUN
cana-3401	81	12	to	to	ADP
cana-3401	81	13	these	these	DET
cana-3401	81	14	methods	method	NOUN
cana-3401	81	15	,	,	PUNCT
cana-3401	81	16	enabling	enable	VERB
cana-3401	81	17	their	their	PRON
cana-3401	81	18	use	use	NOUN
cana-3401	81	19	in	in	ADP
cana-3401	81	20	more	more	ADJ
cana-3401	81	21	complex	complex	ADJ
cana-3401	81	22	situations	situation	NOUN
cana-3401	81	23	when	when	SCONJ
cana-3401	81	24	multiple	multiple	ADJ
cana-3401	81	25	graph	graph	NOUN
cana-3401	81	26	classes	class	NOUN
cana-3401	81	27	must	must	AUX
cana-3401	81	28	be	be	AUX
cana-3401	81	29	considered	consider	VERB
cana-3401	81	30	.	.	PUNCT
cana-3401	82	1	recent	recent	ADJ
cana-3401	82	2	mathematical	mathematical	ADJ
cana-3401	82	3	problem	problem	NOUN
cana-3401	82	4	considered	consider	VERB
cana-3401	82	5	by	by	ADP
cana-3401	82	6	bevern	bevern	PROPN
cana-3401	82	7	et	et	PROPN
cana-3401	82	8	al	al	PROPN
cana-3401	82	9	.	.	PROPN
cana-3401	83	1	(	(	PUNCT
cana-3401	83	2	2018	2018	NUM
cana-3401	83	3	)	)	PUNCT
cana-3401	83	4	includes	include	VERB
cana-3401	83	5	the	the	DET
cana-3401	83	6	computational	computational	ADJ
cana-3401	83	7	challenge	challenge	NOUN
cana-3401	83	8	of	of	ADP
cana-3401	83	9	problems	problem	NOUN
cana-3401	83	10	with	with	ADP
cana-3401	83	11	forbidden	forbid	VERB
cana-3401	83	12	subgraph	subgraph	NOUN
cana-3401	83	13	constraints	constraint	NOUN
cana-3401	83	14	that	that	PRON
cana-3401	83	15	raises	raise	VERB
cana-3401	83	16	an	an	DET
cana-3401	83	17	important	important	ADJ
cana-3401	83	18	aspect	aspect	NOUN
cana-3401	83	19	in	in	ADP
cana-3401	83	20	the	the	DET
cana-3401	83	21	study	study	NOUN
cana-3401	83	22	of	of	ADP
cana-3401	83	23	graph	graph	NOUN
cana-3401	83	24	theory	theory	NOUN
cana-3401	83	25	.	.	PUNCT
cana-3401	84	1	part	part	NOUN
cana-3401	84	2	of	of	ADP
cana-3401	84	3	these	these	DET
cana-3401	84	4	constraints	constraint	NOUN
cana-3401	84	5	define	define	VERB
cana-3401	84	6	which	which	DET
cana-3401	84	7	subgraphs	subgraph	NOUN
cana-3401	84	8	are	be	AUX
cana-3401	84	9	prohibited	prohibit	VERB
cana-3401	84	10	in	in	ADP
cana-3401	84	11	a	a	DET
cana-3401	84	12	partitioned	partition	VERB
cana-3401	84	13	graph	graph	NOUN
cana-3401	84	14	while	while	SCONJ
cana-3401	84	15	communications	communication	NOUN
cana-3401	84	16	on	on	ADP
cana-3401	84	17	applied	apply	VERB
cana-3401	84	18	nonlinear	nonlinear	ADJ
cana-3401	84	19	analysis	analysis	NOUN
cana-3401	84	20	issn	issn	NOUN
cana-3401	84	21	:	:	PUNCT
cana-3401	84	22	1074	1074	NUM
cana-3401	84	23	-	-	PUNCT
cana-3401	84	24	133x	133x	NUM
cana-3401	84	25	vol	vol	NOUN
cana-3401	84	26	32	32	NUM
cana-3401	84	27	no	no	NOUN
cana-3401	84	28	.	.	PUNCT
cana-3401	85	1	7s	7	NOUN
cana-3401	85	2	(	(	PUNCT
cana-3401	85	3	2025	2025	NUM
cana-3401	85	4	)	)	PUNCT
cana-3401	85	5	300	300	NUM
cana-3401	85	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	85	7	their	their	PRON
cana-3401	85	8	addition	addition	NOUN
cana-3401	85	9	can	can	AUX
cana-3401	85	10	greatly	greatly	ADV
cana-3401	85	11	complicate	complicate	VERB
cana-3401	85	12	a	a	DET
cana-3401	85	13	graph	graph	NOUN
cana-3401	85	14	problem	problem	NOUN
cana-3401	85	15	.	.	PUNCT
cana-3401	86	1	some	some	DET
cana-3401	86	2	related	related	ADJ
cana-3401	86	3	work	work	NOUN
cana-3401	86	4	in	in	ADP
cana-3401	86	5	this	this	DET
cana-3401	86	6	area	area	NOUN
cana-3401	86	7	has	have	AUX
cana-3401	86	8	been	be	AUX
cana-3401	86	9	done	do	VERB
cana-3401	86	10	by	by	ADP
cana-3401	86	11	bevern	bevern	NOUN
cana-3401	86	12	and	and	CCONJ
cana-3401	86	13	others	other	NOUN
cana-3401	86	14	,	,	PUNCT
cana-3401	86	15	who	who	PRON
cana-3401	86	16	provide	provide	VERB
cana-3401	86	17	algorithms	algorithm	NOUN
cana-3401	86	18	that	that	PRON
cana-3401	86	19	meet	meet	VERB
cana-3401	86	20	the	the	DET
cana-3401	86	21	above	above	ADJ
cana-3401	86	22	criteria	criterion	NOUN
cana-3401	86	23	and	and	CCONJ
cana-3401	86	24	offer	offer	VERB
cana-3401	86	25	a	a	DET
cana-3401	86	26	solution	solution	NOUN
cana-3401	86	27	base	base	NOUN
cana-3401	86	28	for	for	ADP
cana-3401	86	29	the	the	DET
cana-3401	86	30	refinement	refinement	NOUN
cana-3401	86	31	,	,	PUNCT
cana-3401	86	32	which	which	PRON
cana-3401	86	33	creates	create	VERB
cana-3401	86	34	new	new	ADJ
cana-3401	86	35	natural	natural	ADJ
cana-3401	86	36	constraints	constraint	NOUN
cana-3401	86	37	for	for	ADP
cana-3401	86	38	the	the	DET
cana-3401	86	39	graph	graph	NOUN
cana-3401	86	40	partitioning	partition	VERB
cana-3401	86	41	analysis.[13	analysis.[13	PROPN
cana-3401	86	42	]	]	PUNCT
cana-3401	86	43	this	this	DET
cana-3401	86	44	work	work	NOUN
cana-3401	86	45	is	be	AUX
cana-3401	86	46	constructive	constructive	ADJ
cana-3401	86	47	in	in	ADP
cana-3401	86	48	the	the	DET
cana-3401	86	49	enumeration	enumeration	NOUN
cana-3401	86	50	of	of	ADP
cana-3401	86	51	k	k	ADJ
cana-3401	86	52	-	-	ADJ
cana-3401	86	53	secluded	secluded	ADJ
cana-3401	86	54	vertex	vertex	NOUN
cana-3401	86	55	sets	set	NOUN
cana-3401	86	56	since	since	SCONJ
cana-3401	86	57	the	the	DET
cana-3401	86	58	resulting	result	VERB
cana-3401	86	59	partitions	partition	NOUN
cana-3401	86	60	never	never	ADV
cana-3401	86	61	allow	allow	VERB
cana-3401	86	62	any	any	DET
cana-3401	86	63	forbidden	forbid	VERB
cana-3401	86	64	subgraph	subgraph	NOUN
cana-3401	86	65	structures	structure	NOUN
cana-3401	86	66	to	to	PART
cana-3401	86	67	be	be	AUX
cana-3401	86	68	formed	form	VERB
cana-3401	86	69	while	while	SCONJ
cana-3401	86	70	solving	solve	VERB
cana-3401	86	71	the	the	DET
cana-3401	86	72	problem	problem	NOUN
cana-3401	86	73	.	.	PUNCT
cana-3401	87	1	methodology	methodology	NOUN
cana-3401	87	2	the	the	DET
cana-3401	87	3	work	work	NOUN
cana-3401	87	4	is	be	AUX
cana-3401	87	5	designed	design	VERB
cana-3401	87	6	to	to	PART
cana-3401	87	7	offer	offer	VERB
cana-3401	87	8	a	a	DET
cana-3401	87	9	step	step	NOUN
cana-3401	87	10	-	-	PUNCT
cana-3401	87	11	by	by	ADP
cana-3401	87	12	-	-	PUNCT
cana-3401	87	13	step	step	NOUN
cana-3401	87	14	approach	approach	NOUN
cana-3401	87	15	to	to	ADP
cana-3401	87	16	addressing	address	VERB
cana-3401	87	17	the	the	DET
cana-3401	87	18	graph	graph	NOUN
cana-3401	87	19	connectivity	connectivity	NOUN
cana-3401	87	20	problems	problem	NOUN
cana-3401	87	21	through	through	ADP
cana-3401	87	22	evaluating	evaluate	VERB
cana-3401	87	23	the	the	DET
cana-3401	87	24	presence	presence	NOUN
cana-3401	87	25	of	of	ADP
cana-3401	87	26	k	k	ADJ
cana-3401	87	27	-	-	ADJ
cana-3401	87	28	secluded	secluded	ADJ
cana-3401	87	29	vertex	vertex	NOUN
cana-3401	87	30	sets	set	NOUN
cana-3401	87	31	and	and	CCONJ
cana-3401	87	32	guaranteeing	guarantee	VERB
cana-3401	87	33	connectivity	connectivity	NOUN
cana-3401	87	34	conditions	condition	NOUN
cana-3401	87	35	.	.	PUNCT
cana-3401	88	1	data	datum	NOUN
cana-3401	88	2	preparation	preparation	NOUN
cana-3401	88	3	the	the	DET
cana-3401	88	4	analysed	analyse	VERB
cana-3401	88	5	datasets	dataset	NOUN
cana-3401	88	6	which	which	PRON
cana-3401	88	7	consist	consist	VERB
cana-3401	88	8	of	of	ADP
cana-3401	88	9	synthetic	synthetic	ADJ
cana-3401	88	10	graph	graph	NOUN
cana-3401	88	11	and	and	CCONJ
cana-3401	88	12	real	real	ADJ
cana-3401	88	13	graphs	graph	NOUN
cana-3401	88	14	also	also	ADV
cana-3401	88	15	have	have	VERB
cana-3401	88	16	different	different	ADJ
cana-3401	88	17	sizes	size	NOUN
cana-3401	88	18	,	,	PUNCT
cana-3401	88	19	edge	edge	NOUN
cana-3401	88	20	densities	density	NOUN
cana-3401	88	21	,	,	PUNCT
cana-3401	88	22	and	and	CCONJ
cana-3401	88	23	connectivity	connectivity	NOUN
cana-3401	88	24	characters	character	NOUN
cana-3401	88	25	.	.	PUNCT
cana-3401	89	1	the	the	DET
cana-3401	89	2	characteristics	characteristic	NOUN
cana-3401	89	3	of	of	ADP
cana-3401	89	4	the	the	DET
cana-3401	89	5	datasets	dataset	NOUN
cana-3401	89	6	are	be	AUX
cana-3401	89	7	summarized	summarize	VERB
cana-3401	89	8	in	in	ADP
cana-3401	89	9	the	the	DET
cana-3401	89	10	following	follow	VERB
cana-3401	89	11	table	table	NOUN
cana-3401	89	12	:	:	PUNCT
cana-3401	89	13	data	datum	NOUN
cana-3401	89	14	set	set	VERB
cana-3401	89	15	vertices	vertex	NOUN
cana-3401	89	16	(	(	PUNCT
cana-3401	89	17	v	v	NOUN
cana-3401	89	18	)	)	PUNCT
cana-3401	89	19	edges(e	edges(e	PROPN
cana-3401	89	20	)	)	PUNCT
cana-3401	89	21	average	average	ADJ
cana-3401	89	22	degree	degree	NOUN
cana-3401	89	23	density	density	NOUN
cana-3401	89	24	connectivity	connectivity	NOUN
cana-3401	89	25	type	type	NOUN
cana-3401	89	26	fuzzy	fuzzy	ADJ
cana-3401	89	27	values	value	NOUN
cana-3401	89	28	social	social	ADJ
cana-3401	89	29	network	network	NOUN
cana-3401	89	30	10,000	10,000	NUM
cana-3401	89	31	50,000	50,000	NUM
cana-3401	89	32	5	5	NUM
cana-3401	89	33	0.001	0.001	NUM
cana-3401	89	34	high	high	ADJ
cana-3401	89	35	1.0	1.0	NUM
cana-3401	89	36	infrastructure	infrastructure	NOUN
cana-3401	89	37	5,000	5,000	NUM
cana-3401	89	38	20,000	20,000	NUM
cana-3401	89	39	4	4	NUM
cana-3401	89	40	0.0016	0.0016	NUM
cana-3401	89	41	medium	medium	NOUN
cana-3401	89	42	0.75	0.75	NUM
cana-3401	89	43	random	random	ADJ
cana-3401	89	44	graph	graph	NOUN
cana-3401	89	45	2,000	2,000	NUM
cana-3401	89	46	4,000	4,000	NUM
cana-3401	89	47	2	2	NUM
cana-3401	89	48	0.002	0.002	NUM
cana-3401	89	49	low	low	ADJ
cana-3401	89	50	0.4	0.4	NUM
cana-3401	89	51	biological	biological	ADJ
cana-3401	89	52	1,500	1,500	NUM
cana-3401	89	53	3,500	3,500	NUM
cana-3401	89	54	2.33	2.33	NUM
cana-3401	89	55	0/0031	0/0031	NOUN
cana-3401	89	56	medium	medium	NOUN
cana-3401	89	57	0.2	0.2	NUM
cana-3401	89	58	synthetic	synthetic	ADJ
cana-3401	89	59	500	500	NUM
cana-3401	89	60	1,000	1,000	NUM
cana-3401	89	61	2	2	NUM
cana-3401	89	62	0.004	0.004	NUM
cana-3401	89	63	variable	variable	NOUN
cana-3401	89	64	0	0	NUM
cana-3401	89	65	graph	graph	NOUN
cana-3401	89	66	representation	representation	NOUN
cana-3401	89	67	is	be	AUX
cana-3401	89	68	used	use	VERB
cana-3401	89	69	together	together	ADV
cana-3401	89	70	with	with	ADP
cana-3401	89	71	preliminaries	preliminary	NOUN
cana-3401	89	72	in	in	ADP
cana-3401	89	73	studying	study	VERB
cana-3401	89	74	various	various	ADJ
cana-3401	89	75	networks	network	NOUN
cana-3401	89	76	[	[	X
cana-3401	89	77	14	14	NUM
cana-3401	89	78	]	]	PUNCT
cana-3401	89	79	.	.	PUNCT
cana-3401	90	1	we	we	PRON
cana-3401	90	2	consider	consider	VERB
cana-3401	90	3	traversability	traversability	NOUN
cana-3401	90	4	of	of	ADP
cana-3401	90	5	signed	sign	VERB
cana-3401	90	6	graphs	graph	NOUN
cana-3401	90	7	let	let	VERB
cana-3401	90	8	g	g	NOUN
cana-3401	90	9	=	=	SYM
cana-3401	90	10	(	(	PUNCT
cana-3401	90	11	v	v	NOUN
cana-3401	90	12	,	,	PUNCT
cana-3401	90	13	e	e	NOUN
cana-3401	90	14	)	)	PUNCT
cana-3401	90	15	be	be	AUX
cana-3401	90	16	a	a	DET
cana-3401	90	17	simple	simple	ADJ
cana-3401	90	18	undirected	undirected	ADJ
cana-3401	90	19	graph	graph	NOUN
cana-3401	90	20	,	,	PUNCT
cana-3401	90	21	where	where	SCONJ
cana-3401	90	22	v	v	NOUN
cana-3401	90	23	signifies	signifie	NOUN
cana-3401	90	24	vertices	vertice	VERB
cana-3401	90	25	and	and	CCONJ
cana-3401	90	26	e	e	NOUN
cana-3401	90	27	signifies	signifie	NOUN
cana-3401	90	28	edges	edge	VERB
cana-3401	90	29	.	.	PUNCT
cana-3401	91	1	each	each	DET
cana-3401	91	2	vertex	vertex	NOUN
cana-3401	91	3	v∈v	v∈v	NOUN
cana-3401	91	4	has	have	VERB
cana-3401	91	5	a	a	DET
cana-3401	91	6	neighborhood	neighborhood	NOUN
cana-3401	91	7	n	n	CCONJ
cana-3401	91	8	(	(	PUNCT
cana-3401	91	9	v	v	NOUN
cana-3401	91	10	)	)	PUNCT
cana-3401	91	11	defined	define	VERB
cana-3401	91	12	as	as	ADP
cana-3401	91	13	:	:	PUNCT
cana-3401	91	14	vertex	vertex	NOUN
cana-3401	91	15	v	v	NOUN
cana-3401	91	16	degree	degree	NOUN
cana-3401	91	17	d(v	d(v	PROPN
cana-3401	91	18	)	)	PUNCT
cana-3401	91	19	neighbourhood	neighbourhood	NOUN
cana-3401	91	20	n(v	n(v	PROPN
cana-3401	91	21	)	)	PUNCT
cana-3401	91	22	k	k	ADJ
cana-3401	91	23	-	-	PUNCT
cana-3401	91	24	seclusion	seclusion	NOUN
cana-3401	91	25	fuzzification	fuzzification	NOUN
cana-3401	91	26	1	1	NUM
cana-3401	91	27	3	3	NUM
cana-3401	91	28	(	(	PUNCT
cana-3401	91	29	2,4,5	2,4,5	NUM
cana-3401	91	30	}	}	PUNCT
cana-3401	91	31	yes	yes	NOUN
cana-3401	91	32	3.67	3.67	NUM
cana-3401	91	33	2	2	NUM
cana-3401	91	34	2	2	NUM
cana-3401	91	35	[	[	X
cana-3401	91	36	1,3	1,3	NUM
cana-3401	91	37	}	}	PUNCT
cana-3401	91	38	yes	yes	NOUN
cana-3401	91	39	2	2	NUM
cana-3401	91	40	3	3	NUM
cana-3401	91	41	4	4	NUM
cana-3401	91	42	{	{	PUNCT
cana-3401	91	43	2,4,5,6	2,4,5,6	NUM
cana-3401	91	44	}	}	PUNCT
cana-3401	91	45	no	no	PRON
cana-3401	91	46	4.25	4.25	NUM
cana-3401	91	47	4	4	NUM
cana-3401	91	48	3	3	NUM
cana-3401	91	49	{	{	PUNCT
cana-3401	91	50	1,3,6	1,3,6	NUM
cana-3401	91	51	}	}	PUNCT
cana-3401	91	52	yes	yes	ADV
cana-3401	91	53	3.333	3.333	NUM
cana-3401	91	54	to	to	PART
cana-3401	91	55	promote	promote	VERB
cana-3401	91	56	efficiency	efficiency	NOUN
cana-3401	91	57	in	in	ADP
cana-3401	91	58	ges	ge	NOUN
cana-3401	91	59	,	,	PUNCT
cana-3401	91	60	the	the	DET
cana-3401	91	61	latter	latter	ADJ
cana-3401	91	62	involves	involve	VERB
cana-3401	91	63	the	the	DET
cana-3401	91	64	k	k	ADJ
cana-3401	91	65	-	-	PUNCT
cana-3401	91	66	seclusion	seclusion	NOUN
cana-3401	91	67	condition	condition	NOUN
cana-3401	91	68	for	for	ADP
cana-3401	91	69	each	each	DET
cana-3401	91	70	vertex	vertex	NOUN
cana-3401	91	71	v	v	NOUN
cana-3401	91	72	from	from	ADP
cana-3401	91	73	the	the	DET
cana-3401	91	74	subgraph	subgraph	NOUN
cana-3401	91	75	gs	gs	PROPN
cana-3401	91	76	induced	induce	VERB
cana-3401	91	77	by	by	ADP
cana-3401	91	78	the	the	DET
cana-3401	91	79	set	set	NOUN
cana-3401	91	80	s⊆vs	s⊆v	NOUN
cana-3401	91	81	induced	induce	VERB
cana-3401	91	82	by	by	ADP
cana-3401	91	83	the	the	DET
cana-3401	91	84	set	set	NOUN
cana-3401	91	85	s⊆vs	s⊆vs	NOUN
cana-3401	91	86	∣ns(v)∣	∣ns(v)∣	NOUN
cana-3401	91	87	≤k	≤k	VERB
cana-3401	91	88	where	where	SCONJ
cana-3401	91	89	ns(v)=n(v)∩s	ns(v)=n(v)∩s	PROPN
cana-3401	91	90	,	,	PUNCT
cana-3401	91	91	understands	understand	VERB
cana-3401	91	92	the	the	DET
cana-3401	91	93	neighborhood	neighborhood	NOUN
cana-3401	91	94	of	of	ADP
cana-3401	91	95	v	v	NOUN
cana-3401	91	96	in	in	ADP
cana-3401	91	97	the	the	DET
cana-3401	91	98	context	context	NOUN
cana-3401	91	99	of	of	ADP
cana-3401	91	100	the	the	DET
cana-3401	91	101	set	set	NOUN
cana-3401	91	102	s.	s.	PROPN
cana-3401	91	103	in	in	ADP
cana-3401	91	104	the	the	DET
cana-3401	91	105	case	case	NOUN
cana-3401	91	106	of	of	ADP
cana-3401	91	107	a	a	DET
cana-3401	91	108	subgraph	subgraph	NOUN
cana-3401	91	109	defined	define	VERB
cana-3401	91	110	as	as	ADP
cana-3401	91	111	gs=	gs=	PROPN
cana-3401	91	112	(	(	PUNCT
cana-3401	91	113	s	s	PROPN
cana-3401	91	114	,	,	PUNCT
cana-3401	91	115	es	es	NOUN
cana-3401	91	116	)	)	PUNCT
cana-3401	91	117	where	where	SCONJ
cana-3401	91	118	es	es	NOUN
cana-3401	91	119	is	be	AUX
cana-3401	91	120	the	the	DET
cana-3401	91	121	set	set	NOUN
cana-3401	91	122	of	of	ADP
cana-3401	91	123	edges	edge	NOUN
cana-3401	91	124	connecting	connect	VERB
cana-3401	91	125	vertices	vertex	NOUN
cana-3401	91	126	in	in	ADP
cana-3401	91	127	s	s	PROPN
cana-3401	91	128	,	,	PUNCT
cana-3401	91	129	gs	gs	PROPN
cana-3401	91	130	must	must	AUX
cana-3401	91	131	be	be	AUX
cana-3401	91	132	connected	connect	VERB
cana-3401	91	133	,	,	PUNCT
cana-3401	91	134	induced	induce	VERB
cana-3401	91	135	by	by	ADP
cana-3401	91	136	the	the	DET
cana-3401	91	137	set	set	NOUN
cana-3401	91	138	s⊆vs	s⊆vs	NOUN
cana-3401	91	139	communications	communication	NOUN
cana-3401	91	140	on	on	ADP
cana-3401	91	141	applied	apply	VERB
cana-3401	91	142	nonlinear	nonlinear	ADJ
cana-3401	91	143	analysis	analysis	NOUN
cana-3401	91	144	issn	issn	NOUN
cana-3401	91	145	:	:	PUNCT
cana-3401	91	146	1074	1074	NUM
cana-3401	91	147	-	-	PUNCT
cana-3401	91	148	133x	133x	NUM
cana-3401	91	149	vol	vol	NOUN
cana-3401	91	150	32	32	NUM
cana-3401	91	151	no	no	NOUN
cana-3401	91	152	.	.	PUNCT
cana-3401	92	1	7s	7	NOUN
cana-3401	92	2	(	(	PUNCT
cana-3401	92	3	2025	2025	NUM
cana-3401	92	4	)	)	PUNCT
cana-3401	92	5	301	301	NUM
cana-3401	92	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	92	7	subgraph	subgraph	NOUN
cana-3401	92	8	connectivity	connectivity	NOUN
cana-3401	92	9	for	for	ADP
cana-3401	92	10	the	the	DET
cana-3401	92	11	subgraph	subgraph	NOUN
cana-3401	92	12	gs=	gs=	PROPN
cana-3401	92	13	(	(	PUNCT
cana-3401	92	14	s	s	PROPN
cana-3401	92	15	,	,	PUNCT
cana-3401	92	16	es	es	NOUN
cana-3401	92	17	)	)	PUNCT
cana-3401	92	18	,	,	PUNCT
cana-3401	92	19	where	where	SCONJ
cana-3401	92	20	es	es	NOUN
cana-3401	92	21	are	be	AUX
cana-3401	92	22	the	the	DET
cana-3401	92	23	edges	edge	NOUN
cana-3401	92	24	between	between	ADP
cana-3401	92	25	vertices	vertex	NOUN
cana-3401	92	26	in	in	ADP
cana-3401	92	27	s	s	PROPN
cana-3401	92	28	,	,	PUNCT
cana-3401	92	29	gs	gs	PROPN
cana-3401	92	30	must	must	AUX
cana-3401	92	31	be	be	AUX
cana-3401	92	32	connected	connect	VERB
cana-3401	92	33	.	.	PUNCT
cana-3401	93	1	formally	formally	ADV
cana-3401	93	2	,	,	PUNCT
cana-3401	93	3	this	this	PRON
cana-3401	93	4	is	be	AUX
cana-3401	93	5	expressed	express	VERB
cana-3401	93	6	as	as	ADP
cana-3401	93	7	:	:	PUNCT
cana-3401	93	8	for	for	ADP
cana-3401	93	9	all	all	DET
cana-3401	93	10	pair	pair	NOUN
cana-3401	93	11	of	of	ADP
cana-3401	93	12	nodes	node	NOUN
cana-3401	93	13	u	u	NOUN
cana-3401	93	14	,	,	PUNCT
cana-3401	93	15	v	v	NOUN
cana-3401	93	16	in	in	ADP
cana-3401	93	17	s	s	PRON
cana-3401	93	18	there	there	PRON
cana-3401	93	19	always	always	ADV
cana-3401	93	20	exist	exist	VERB
cana-3401	93	21	a	a	DET
cana-3401	93	22	path	path	NOUN
cana-3401	93	23	p	p	X
cana-3401	93	24	=	=	PUNCT
cana-3401	93	25	(	(	PUNCT
cana-3401	93	26	u1	u1	PROPN
cana-3401	93	27	,	,	PUNCT
cana-3401	93	28	u2	u2	PROPN
cana-3401	93	29	,	,	PUNCT
cana-3401	93	30	…	…	PUNCT
cana-3401	93	31	,	,	PUNCT
cana-3401	93	32	un	un	PROPN
cana-3401	93	33	)	)	PUNCT
cana-3401	93	34	where	where	SCONJ
cana-3401	93	35	u	u	NOUN
cana-3401	93	36	=	=	NOUN
cana-3401	93	37	u1	u1	NOUN
cana-3401	93	38	and	and	CCONJ
cana-3401	93	39	v	v	NOUN
cana-3401	93	40	=	=	SYM
cana-3401	93	41	un	un	PROPN
cana-3401	93	42	and	and	CCONJ
cana-3401	93	43	all	all	DET
cana-3401	93	44	intermediate	intermediate	ADJ
cana-3401	93	45	nodes	node	NOUN
cana-3401	93	46	in	in	ADP
cana-3401	93	47	the	the	DET
cana-3401	93	48	path	path	NOUN
cana-3401	93	49	belong	belong	VERB
cana-3401	93	50	to	to	ADP
cana-3401	93	51	the	the	DET
cana-3401	93	52	set	set	NOUN
cana-3401	93	53	(	(	PUNCT
cana-3401	93	54	ui	ui	NOUN
cana-3401	93	55	,	,	PUNCT
cana-3401	93	56	ui+1	ui+1	ADJ
cana-3401	93	57	)	)	PUNCT
cana-3401	93	58	∈	∈	NOUN
cana-3401	93	59	es	es	ADP
cana-3401	93	60	this	this	PRON
cana-3401	93	61	helps	help	VERB
cana-3401	93	62	in	in	ADP
cana-3401	93	63	making	make	VERB
cana-3401	93	64	sure	sure	ADJ
cana-3401	93	65	that	that	SCONJ
cana-3401	93	66	any	any	DET
cana-3401	93	67	two	two	NUM
cana-3401	93	68	vertices	vertex	NOUN
cana-3401	93	69	in	in	ADP
cana-3401	93	70	s	s	NOUN
cana-3401	93	71	can	can	AUX
cana-3401	93	72	be	be	AUX
cana-3401	93	73	easily	easily	ADV
cana-3401	93	74	accessed	access	VERB
cana-3401	93	75	from	from	ADP
cana-3401	93	76	a	a	DET
cana-3401	93	77	particular	particular	ADJ
cana-3401	93	78	another	another	PRON
cana-3401	93	79	by	by	ADP
cana-3401	93	80	the	the	DET
cana-3401	93	81	help	help	NOUN
cana-3401	93	82	of	of	ADP
cana-3401	93	83	edges	edge	NOUN
cana-3401	93	84	in	in	ADP
cana-3401	93	85	es	es	NOUN
cana-3401	93	86	.	.	PUNCT
cana-3401	94	1	the	the	DET
cana-3401	94	2	objective	objective	NOUN
cana-3401	94	3	is	be	AUX
cana-3401	94	4	to	to	PART
cana-3401	94	5	find	find	VERB
cana-3401	94	6	a	a	DET
cana-3401	94	7	maximal	maximal	ADJ
cana-3401	94	8	subset	subset	NOUN
cana-3401	94	9	s⊆vs	s⊆vs	NOUN
cana-3401	94	10	such	such	ADJ
cana-3401	94	11	that	that	SCONJ
cana-3401	94	12	:	:	PUNCT
cana-3401	94	13	1	1	X
cana-3401	94	14	.	.	X
cana-3401	94	15	each	each	DET
cana-3401	94	16	vertex	vertex	NOUN
cana-3401	94	17	v∈sv	v∈sv	NOUN
cana-3401	94	18	satisfies	satisfy	VERB
cana-3401	94	19	the	the	DET
cana-3401	94	20	k	k	ADJ
cana-3401	94	21	-	-	PUNCT
cana-3401	94	22	seclusion	seclusion	NOUN
cana-3401	94	23	condition	condition	NOUN
cana-3401	94	24	:	:	PUNCT
cana-3401	95	1	2	2	X
cana-3401	95	2	.	.	X
cana-3401	95	3	the	the	DET
cana-3401	95	4	subgraph	subgraph	NOUN
cana-3401	95	5	gs	gs	PROPN
cana-3401	95	6	is	be	AUX
cana-3401	95	7	connected	connect	VERB
cana-3401	95	8	.	.	PUNCT
cana-3401	96	1	we	we	PRON
cana-3401	96	2	set	set	VERB
cana-3401	96	3	a	a	DET
cana-3401	96	4	binary	binary	ADJ
cana-3401	96	5	variable	variable	NOUN
cana-3401	96	6	xv	xv	PROPN
cana-3401	96	7	for	for	ADP
cana-3401	96	8	each	each	DET
cana-3401	96	9	vertex	vertex	NOUN
cana-3401	96	10	v∈v	v∈v	NOUN
cana-3401	96	11	so	so	SCONJ
cana-3401	96	12	that	that	SCONJ
cana-3401	96	13	xv	xv	PROPN
cana-3401	96	14	is	be	AUX
cana-3401	96	15	equal	equal	ADJ
cana-3401	96	16	to	to	ADP
cana-3401	96	17	1	1	NUM
cana-3401	96	18	,	,	PUNCT
cana-3401	96	19	if	if	SCONJ
cana-3401	96	20	v	v	NOUN
cana-3401	96	21	is	be	AUX
cana-3401	96	22	in	in	ADP
cana-3401	96	23	s	s	PROPN
cana-3401	96	24	,	,	PUNCT
cana-3401	96	25	and	and	CCONJ
cana-3401	96	26	xv	xv	PROPN
cana-3401	96	27	is	be	AUX
cana-3401	96	28	equal	equal	ADJ
cana-3401	96	29	to	to	ADP
cana-3401	96	30	0	0	NUM
cana-3401	96	31	otherwise	otherwise	ADV
cana-3401	96	32	.	.	PUNCT
cana-3401	97	1	fig.2	fig.2	NOUN
cana-3401	97	2	the	the	DET
cana-3401	97	3	constraints	constraint	NOUN
cana-3401	97	4	can	can	AUX
cana-3401	97	5	be	be	AUX
cana-3401	97	6	formulated	formulate	VERB
cana-3401	97	7	as	as	ADP
cana-3401	97	8	:	:	PUNCT
cana-3401	97	9	∑u∈n(v)xu≤k	∑u∈n(v)xu≤k	NOUN
cana-3401	97	10	,	,	PUNCT
cana-3401	97	11	for	for	ADP
cana-3401	97	12	all	all	DET
cana-3401	97	13	v∈v	v∈v	NOUN
cana-3401	97	14	for	for	ADP
cana-3401	97	15	k	k	NOUN
cana-3401	97	16	-	-	NOUN
cana-3401	97	17	seclusion	seclusion	NOUN
cana-3401	97	18	,	,	PUNCT
cana-3401	97	19	and	and	CCONJ
cana-3401	97	20	for	for	SCONJ
cana-3401	97	21	gs	gs	INTJ
cana-3401	97	22	to	to	PART
cana-3401	97	23	stay	stay	VERB
cana-3401	97	24	connected	connect	VERB
cana-3401	97	25	,	,	PUNCT
cana-3401	97	26	for	for	SCONJ
cana-3401	97	27	all	all	PRON
cana-3401	97	28	s	s	PART
cana-3401	98	1	⊆	⊆	NUM
cana-3401	98	2	v	v	NOUN
cana-3401	98	3	n(v)=	n(v)=	ADJ
cana-3401	98	4	{	{	PUNCT
cana-3401	98	5	u∈v	u∈v	NOUN
cana-3401	98	6	∣	∣	PROPN
cana-3401	98	7	(	(	PUNCT
cana-3401	98	8	v	v	NOUN
cana-3401	98	9	,	,	PUNCT
cana-3401	98	10	u	u	NOUN
cana-3401	98	11	)	)	PUNCT
cana-3401	98	12	∈	∈	PROPN
cana-3401	98	13	e	e	NOUN
cana-3401	98	14	}	}	PUNCT
cana-3401	98	15	the	the	DET
cana-3401	98	16	degree	degree	NOUN
cana-3401	98	17	of	of	ADP
cana-3401	98	18	a	a	DET
cana-3401	98	19	vertex	vertex	NOUN
cana-3401	98	20	v	v	NOUN
cana-3401	98	21	,	,	PUNCT
cana-3401	98	22	denoted	denote	VERB
cana-3401	98	23	as	as	ADP
cana-3401	98	24	d(v	d(v	PROPN
cana-3401	98	25	)	)	PUNCT
cana-3401	98	26	,	,	PUNCT
cana-3401	98	27	is	be	AUX
cana-3401	98	28	the	the	DET
cana-3401	98	29	size	size	NOUN
cana-3401	98	30	of	of	ADP
cana-3401	98	31	its	its	PRON
cana-3401	98	32	neighborhood	neighborhood	NOUN
cana-3401	98	33	:	:	PUNCT
cana-3401	98	34	d(v)=∣n(v)∣	d(v)=∣n(v)∣	X
cana-3401	98	35	a	a	DET
cana-3401	98	36	graph	graph	NOUN
cana-3401	98	37	g	g	NOUN
cana-3401	98	38	is	be	AUX
cana-3401	98	39	stated	state	VERB
cana-3401	98	40	to	to	PART
cana-3401	98	41	be	be	AUX
cana-3401	98	42	connected	connect	VERB
cana-3401	98	43	if	if	SCONJ
cana-3401	98	44	there	there	PRON
cana-3401	98	45	is	be	VERB
cana-3401	98	46	a	a	DET
cana-3401	98	47	path	path	NOUN
cana-3401	98	48	from	from	ADP
cana-3401	98	49	any	any	DET
cana-3401	98	50	node	node	NOUN
cana-3401	98	51	of	of	ADP
cana-3401	98	52	the	the	DET
cana-3401	98	53	graph	graph	NOUN
cana-3401	98	54	g.	g.	PROPN
cana-3401	98	55	fig.2	fig.2	PROPN
cana-3401	98	56	.	.	PUNCT
cana-3401	99	1	ingredients	ingredient	NOUN
cana-3401	99	2	of	of	ADP
cana-3401	99	3	enrichment	enrichment	NOUN
cana-3401	99	4	and	and	CCONJ
cana-3401	99	5	the	the	DET
cana-3401	99	6	branching	branch	VERB
cana-3401	99	7	process	process	NOUN
cana-3401	99	8	onnectivity	onnectivity	NOUN
cana-3401	99	9	constraint	constraint	NOUN
cana-3401	99	10	through	through	ADP
cana-3401	99	11	use	use	NOUN
cana-3401	99	12	of	of	ADP
cana-3401	99	13	spanning	span	VERB
cana-3401	99	14	tree	tree	NOUN
cana-3401	99	15	with	with	ADP
cana-3401	99	16	an	an	DET
cana-3401	99	17	elimination	elimination	NOUN
cana-3401	99	18	of	of	ADP
cana-3401	99	19	connectivity	connectivity	NOUN
cana-3401	99	20	by	by	ADP
cana-3401	99	21	the	the	DET
cana-3401	99	22	concept	concept	NOUN
cana-3401	99	23	of	of	ADP
cana-3401	99	24	a	a	DET
cana-3401	99	25	spanning	span	VERB
cana-3401	99	26	tree	tree	NOUN
cana-3401	99	27	t	t	PROPN
cana-3401	99	28	of	of	ADP
cana-3401	99	29	gs	gs	PROPN
cana-3401	99	30	is	be	AUX
cana-3401	99	31	connected	connect	VERB
cana-3401	99	32	if	if	SCONJ
cana-3401	99	33	there	there	PRON
cana-3401	99	34	exists	exist	VERB
cana-3401	99	35	a	a	DET
cana-3401	99	36	spanning	span	VERB
cana-3401	99	37	tree	tree	NOUN
cana-3401	99	38	t	t	NOUN
cana-3401	99	39	=	=	SYM
cana-3401	99	40	(	(	PUNCT
cana-3401	99	41	s	s	PROPN
cana-3401	99	42	,	,	PUNCT
cana-3401	99	43	et	et	NOUN
cana-3401	99	44	)	)	PUNCT
cana-3401	99	45	such	such	ADJ
cana-3401	99	46	that	that	SCONJ
cana-3401	99	47	et	et	NOUN
cana-3401	99	48	⊆	⊆	NUM
cana-3401	99	49	es	es	ADP
cana-3401	99	50	and	and	CCONJ
cana-3401	99	51	∣	∣	ADJ
cana-3401	99	52	et	et	NOUN
cana-3401	99	53	∣	∣	ADJ
cana-3401	99	54	=	=	PUNCT
cana-3401	99	55	∣	∣	PROPN
cana-3401	99	56	s	s	PART
cana-3401	99	57	∣	∣	ADJ
cana-3401	99	58	1	1	NUM
cana-3401	99	59	.	.	PUNCT
cana-3401	99	60	of	of	ADP
cana-3401	99	61	gs	gs	PROPN
cana-3401	99	62	is	be	AUX
cana-3401	99	63	connected	connect	VERB
cana-3401	99	64	if	if	SCONJ
cana-3401	99	65	there	there	PRON
cana-3401	99	66	exists	exist	VERB
cana-3401	99	67	a	a	DET
cana-3401	99	68	spanning	span	VERB
cana-3401	99	69	tree	tree	NOUN
cana-3401	99	70	t=	t=	NOUN
cana-3401	99	71	(	(	PUNCT
cana-3401	99	72	s	s	PROPN
cana-3401	99	73	,	,	PUNCT
cana-3401	99	74	et	et	NOUN
cana-3401	99	75	)	)	PUNCT
cana-3401	99	76	such	such	ADJ
cana-3401	99	77	that	that	SCONJ
cana-3401	99	78	et⊆es	et⊆es	PROPN
cana-3401	99	79	and	and	CCONJ
cana-3401	99	80	∣et∣=∣s∣−1	∣et∣=∣s∣−1	PROPN
cana-3401	99	81	.	.	PUNCT
cana-3401	100	1	this	this	PRON
cana-3401	100	2	can	can	AUX
cana-3401	100	3	be	be	AUX
cana-3401	100	4	ensured	ensure	VERB
cana-3401	100	5	by	by	ADP
cana-3401	100	6	:	:	PUNCT
cana-3401	100	7	∑e∈etxe≥∣s∣−1	∑e∈etxe≥∣s∣−1	NOUN
cana-3401	100	8	communications	communication	NOUN
cana-3401	100	9	on	on	ADP
cana-3401	100	10	applied	apply	VERB
cana-3401	100	11	nonlinear	nonlinear	ADJ
cana-3401	100	12	analysis	analysis	NOUN
cana-3401	100	13	issn	issn	NOUN
cana-3401	100	14	:	:	PUNCT
cana-3401	100	15	1074	1074	NUM
cana-3401	100	16	-	-	PUNCT
cana-3401	100	17	133x	133x	NUM
cana-3401	100	18	vol	vol	NOUN
cana-3401	100	19	32	32	NUM
cana-3401	100	20	no	no	NOUN
cana-3401	100	21	.	.	PUNCT
cana-3401	101	1	7s	7	NOUN
cana-3401	101	2	(	(	PUNCT
cana-3401	101	3	2025	2025	NUM
cana-3401	101	4	)	)	PUNCT
cana-3401	101	5	302	302	NUM
cana-3401	101	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	101	7	where	where	SCONJ
cana-3401	101	8	xe	xe	PROPN
cana-3401	101	9	is	be	AUX
cana-3401	101	10	a	a	DET
cana-3401	101	11	binary	binary	ADJ
cana-3401	101	12	variable	variable	NOUN
cana-3401	101	13	equal	equal	ADJ
cana-3401	101	14	to	to	ADP
cana-3401	101	15	unity	unity	NOUN
cana-3401	101	16	if	if	SCONJ
cana-3401	101	17	edge	edge	NOUN
cana-3401	101	18	e	e	NOUN
cana-3401	101	19	belongs	belong	VERB
cana-3401	101	20	to	to	ADP
cana-3401	101	21	the	the	DET
cana-3401	101	22	spanning	span	VERB
cana-3401	101	23	tree	tree	NOUN
cana-3401	101	24	and	and	CCONJ
cana-3401	101	25	otherwise	otherwise	ADV
cana-3401	101	26	is	be	AUX
cana-3401	101	27	zero	zero	NUM
cana-3401	101	28	[	[	X
cana-3401	101	29	15	15	NUM
cana-3401	101	30	]	]	PUNCT
cana-3401	101	31	.	.	PUNCT
cana-3401	102	1	optimization	optimization	NOUN
cana-3401	102	2	problem	problem	NOUN
cana-3401	102	3	the	the	DET
cana-3401	102	4	problem	problem	NOUN
cana-3401	102	5	can	can	AUX
cana-3401	102	6	be	be	AUX
cana-3401	102	7	cast	cast	VERB
cana-3401	102	8	as	as	ADP
cana-3401	102	9	an	an	DET
cana-3401	102	10	optimization	optimization	NOUN
cana-3401	102	11	problem	problem	NOUN
cana-3401	102	12	where	where	SCONJ
cana-3401	102	13	we	we	PRON
cana-3401	102	14	maximize	maximize	VERB
cana-3401	102	15	the	the	DET
cana-3401	102	16	size	size	NOUN
cana-3401	102	17	of	of	ADP
cana-3401	102	18	s	s	PRON
cana-3401	102	19	subject	subject	NOUN
cana-3401	102	20	to	to	ADP
cana-3401	102	21	the	the	DET
cana-3401	102	22	k	k	NOUN
cana-3401	102	23	-	-	PUNCT
cana-3401	102	24	seclusion	seclusion	NOUN
cana-3401	102	25	and	and	CCONJ
cana-3401	102	26	connectivity	connectivity	NOUN
cana-3401	102	27	constraints	constraint	NOUN
cana-3401	102	28	:	:	PUNCT
cana-3401	102	29	max	max	PROPN
cana-3401	102	30	∑v∈vxv	∑v∈vxv	PROPN
cana-3401	102	31	accuracy	accuracy	NOUN
cana-3401	102	32	of	of	ADP
cana-3401	102	33	our	our	PRON
cana-3401	102	34	new	new	ADJ
cana-3401	102	35	enumeration	enumeration	NOUN
cana-3401	102	36	algorithm	algorithm	NOUN
cana-3401	102	37	are	be	AUX
cana-3401	102	38	compared	compare	VERB
cana-3401	102	39	with	with	ADP
cana-3401	102	40	previous	previous	ADJ
cana-3401	102	41	algorithms	algorithm	NOUN
cana-3401	102	42	in	in	ADP
cana-3401	102	43	the	the	DET
cana-3401	102	44	table.1	table.1	NOUN
cana-3401	102	45	accuracy	accuracy	NOUN
cana-3401	102	46	and	and	CCONJ
cana-3401	102	47	computational	computational	ADJ
cana-3401	102	48	efficiency	efficiency	NOUN
cana-3401	102	49	table	table	NOUN
cana-3401	102	50	.	.	PUNCT
cana-3401	103	1	specifically	specifically	ADV
cana-3401	103	2	,	,	PUNCT
cana-3401	103	3	our	our	PRON
cana-3401	103	4	algorithm	algorithm	NOUN
cana-3401	103	5	shows	show	VERB
cana-3401	103	6	22	22	NUM
cana-3401	103	7	%	%	NOUN
cana-3401	103	8	improvement	improvement	NOUN
cana-3401	103	9	in	in	ADP
cana-3401	103	10	accuracy	accuracy	NOUN
cana-3401	103	11	,	,	PUNCT
cana-3401	103	12	along	along	ADP
cana-3401	103	13	with	with	ADP
cana-3401	103	14	decreasing	decrease	VERB
cana-3401	103	15	average	average	ADJ
cana-3401	103	16	time	time	NOUN
cana-3401	103	17	per	per	ADP
cana-3401	103	18	instance	instance	NOUN
cana-3401	103	19	on	on	ADP
cana-3401	103	20	average	average	ADJ
cana-3401	103	21	by	by	ADP
cana-3401	103	22	55ms	55ms	ADJ
cana-3401	103	23	and	and	CCONJ
cana-3401	103	24	decreasing	decrease	VERB
cana-3401	103	25	memory	memory	NOUN
cana-3401	103	26	usage	usage	NOUN
cana-3401	103	27	by	by	ADP
cana-3401	103	28	50	50	NUM
cana-3401	103	29	mb	mb	NOUN
cana-3401	103	30	.	.	PUNCT
cana-3401	104	1	furthermore	furthermore	ADV
cana-3401	104	2	,	,	PUNCT
cana-3401	104	3	our	our	PRON
cana-3401	104	4	method	method	NOUN
cana-3401	104	5	reflects	reflect	VERB
cana-3401	104	6	increased	increase	VERB
cana-3401	104	7	scalability	scalability	NOUN
cana-3401	104	8	to	to	PART
cana-3401	104	9	work	work	VERB
cana-3401	104	10	with	with	ADP
cana-3401	104	11	graphs	graph	NOUN
cana-3401	104	12	containing	contain	VERB
cana-3401	104	13	up	up	ADP
cana-3401	104	14	to	to	ADP
cana-3401	104	15	10000	10000	NUM
cana-3401	104	16	nodes	node	NOUN
cana-3401	104	17	compared	compare	VERB
cana-3401	104	18	to	to	ADP
cana-3401	104	19	the	the	DET
cana-3401	104	20	baseline	baseline	ADJ
cana-3401	104	21	methods	method	NOUN
cana-3401	104	22	that	that	PRON
cana-3401	104	23	allow	allow	VERB
cana-3401	104	24	managing	manage	VERB
cana-3401	104	25	graphs	graph	NOUN
cana-3401	104	26	with	with	ADP
cana-3401	104	27	up	up	ADP
cana-3401	104	28	to	to	PART
cana-3401	104	29	1000	1000	NUM
cana-3401	104	30	nodes	node	NOUN
cana-3401	104	31	.	.	PUNCT
cana-3401	105	1	table.1	table.1	VERB
cana-3401	105	2	.	.	PUNCT
cana-3401	106	1	premises	premise	NOUN
cana-3401	106	2	of	of	ADP
cana-3401	106	3	correctness	correctness	NOUN
cana-3401	106	4	these	these	DET
cana-3401	106	5	improvements	improvement	NOUN
cana-3401	106	6	are	be	AUX
cana-3401	106	7	measured	measure	VERB
cana-3401	106	8	in	in	ADP
cana-3401	106	9	terms	term	NOUN
cana-3401	106	10	of	of	ADP
cana-3401	106	11	higher	high	ADJ
cana-3401	106	12	true	true	ADJ
cana-3401	106	13	positive	positive	ADJ
cana-3401	106	14	results	result	NOUN
cana-3401	106	15	and	and	CCONJ
cana-3401	106	16	reduced	reduce	VERB
cana-3401	106	17	false	false	ADJ
cana-3401	106	18	positive	positive	ADJ
cana-3401	106	19	or	or	CCONJ
cana-3401	106	20	false	false	ADJ
cana-3401	106	21	negative	negative	ADJ
cana-3401	106	22	results	result	NOUN
cana-3401	106	23	to	to	PART
cana-3401	106	24	prove	prove	VERB
cana-3401	106	25	that	that	SCONJ
cana-3401	106	26	the	the	DET
cana-3401	106	27	algorithm	algorithm	NOUN
cana-3401	106	28	provides	provide	VERB
cana-3401	106	29	better	well	ADJ
cana-3401	106	30	identification	identification	NOUN
cana-3401	106	31	of	of	ADP
cana-3401	106	32	k	k	ADJ
cana-3401	106	33	-	-	ADJ
cana-3401	106	34	secluded	secluded	ADJ
cana-3401	106	35	vertex	vertex	NOUN
cana-3401	106	36	sets	set	NOUN
cana-3401	106	37	with	with	ADP
cana-3401	106	38	less	less	ADJ
cana-3401	106	39	errors	error	NOUN
cana-3401	106	40	table.2	table.2	PROPN
cana-3401	106	41	.	.	PUNCT
cana-3401	107	1	table.2	table.2	PROPN
cana-3401	107	2	.	.	PROPN
cana-3401	107	3	precision	precision	NOUN
cana-3401	107	4	,	,	PUNCT
cana-3401	107	5	recall	recall	NOUN
cana-3401	107	6	,	,	PUNCT
cana-3401	107	7	and	and	CCONJ
cana-3401	107	8	f1	f1	NOUN
cana-3401	107	9	score	score	NOUN
cana-3401	107	10	breakdown	breakdown	NOUN
cana-3401	107	11	performance	performance	NOUN
cana-3401	107	12	is	be	AUX
cana-3401	107	13	also	also	ADV
cana-3401	107	14	assessed	assess	VERB
cana-3401	107	15	based	base	VERB
cana-3401	107	16	on	on	ADP
cana-3401	107	17	the	the	DET
cana-3401	107	18	type	type	NOUN
cana-3401	107	19	of	of	ADP
cana-3401	107	20	graph	graph	NOUN
cana-3401	107	21	in	in	ADP
cana-3401	107	22	the	the	DET
cana-3401	107	23	performance	performance	NOUN
cana-3401	107	24	across	across	ADP
cana-3401	107	25	different	different	ADJ
cana-3401	107	26	graph	graph	NOUN
cana-3401	107	27	classes	class	NOUN
cana-3401	107	28	table	table	NOUN
cana-3401	107	29	.	.	PUNCT
cana-3401	108	1	table.3	table.3	ADP
cana-3401	108	2	experimental	experimental	ADJ
cana-3401	108	3	results	result	NOUN
cana-3401	108	4	highlight	highlight	VERB
cana-3401	108	5	the	the	DET
cana-3401	108	6	efficiency	efficiency	NOUN
cana-3401	108	7	of	of	ADP
cana-3401	108	8	our	our	PRON
cana-3401	108	9	algorithm	algorithm	NOUN
cana-3401	108	10	with	with	ADP
cana-3401	108	11	high	high	ADJ
cana-3401	108	12	accuracy	accuracy	NOUN
cana-3401	108	13	in	in	ADP
cana-3401	108	14	both	both	CCONJ
cana-3401	108	15	sparse	sparse	ADJ
cana-3401	108	16	and	and	CCONJ
cana-3401	108	17	dense	dense	ADJ
cana-3401	108	18	graphs	graph	NOUN
cana-3401	108	19	;	;	PUNCT
cana-3401	108	20	90	90	NUM
cana-3401	108	21	%	%	NOUN
cana-3401	108	22	in	in	ADP
cana-3401	108	23	the	the	DET
cana-3401	108	24	former	former	ADJ
cana-3401	108	25	and	and	CCONJ
cana-3401	108	26	94	94	NUM
cana-3401	108	27	%	%	NOUN
cana-3401	108	28	in	in	ADP
cana-3401	108	29	the	the	DET
cana-3401	108	30	latter	latter	ADJ
cana-3401	108	31	with	with	ADP
cana-3401	108	32	relatively	relatively	ADV
cana-3401	108	33	outperforming	outperform	VERB
cana-3401	108	34	baseline	baseline	NOUN
cana-3401	108	35	methods	method	NOUN
cana-3401	108	36	.	.	PUNCT
cana-3401	109	1	communications	communication	NOUN
cana-3401	109	2	on	on	ADP
cana-3401	109	3	applied	apply	VERB
cana-3401	109	4	nonlinear	nonlinear	ADJ
cana-3401	109	5	analysis	analysis	NOUN
cana-3401	109	6	issn	issn	NOUN
cana-3401	109	7	:	:	PUNCT
cana-3401	109	8	1074	1074	NUM
cana-3401	109	9	-	-	PUNCT
cana-3401	109	10	133x	133x	NUM
cana-3401	109	11	vol	vol	NOUN
cana-3401	109	12	32	32	NUM
cana-3401	109	13	no	no	NOUN
cana-3401	109	14	.	.	PUNCT
cana-3401	110	1	7s	7	NOUN
cana-3401	110	2	(	(	PUNCT
cana-3401	110	3	2025	2025	NUM
cana-3401	110	4	)	)	PUNCT
cana-3401	110	5	303	303	NUM
cana-3401	110	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	110	7	table.3	table.3	PROPN
cana-3401	110	8	.	.	PUNCT
cana-3401	110	9	performance	performance	NOUN
cana-3401	110	10	for	for	ADP
cana-3401	110	11	various	various	ADJ
cana-3401	110	12	graph	graph	NOUN
cana-3401	110	13	classes	class	NOUN
cana-3401	110	14	finally	finally	ADV
cana-3401	110	15	,	,	PUNCT
cana-3401	110	16	the	the	DET
cana-3401	110	17	algorithm	algorithm	NOUN
cana-3401	110	18	robustness	robustness	NOUN
cana-3401	110	19	under	under	ADP
cana-3401	110	20	constraints	constraint	NOUN
cana-3401	110	21	table	table	NOUN
cana-3401	110	22	presents	present	VERB
cana-3401	110	23	the	the	DET
cana-3401	110	24	results	result	NOUN
cana-3401	110	25	of	of	ADP
cana-3401	110	26	the	the	DET
cana-3401	110	27	algorithm	algorithm	NOUN
cana-3401	110	28	realized	realize	VERB
cana-3401	110	29	on	on	ADP
cana-3401	110	30	graphs	graph	NOUN
cana-3401	110	31	with	with	ADP
cana-3401	110	32	forbidden	forbid	VERB
cana-3401	110	33	induced	induced	ADJ
cana-3401	110	34	subgraphs	subgraph	NOUN
cana-3401	110	35	and	and	CCONJ
cana-3401	110	36	with	with	ADP
cana-3401	110	37	more	more	ADV
cana-3401	110	38	complicated	complicated	ADJ
cana-3401	110	39	separator	separator	NOUN
cana-3401	110	40	conditions	condition	NOUN
cana-3401	110	41	.	.	PUNCT
cana-3401	111	1	table.4	table.4	VERB
cana-3401	111	2	our	our	PRON
cana-3401	111	3	results	result	NOUN
cana-3401	111	4	show	show	VERB
cana-3401	111	5	that	that	SCONJ
cana-3401	111	6	the	the	DET
cana-3401	111	7	new	new	ADJ
cana-3401	111	8	algorithm	algorithm	NOUN
cana-3401	111	9	achieves	achieve	VERB
cana-3401	111	10	high	high	ADJ
cana-3401	111	11	accuracy	accuracy	NOUN
cana-3401	111	12	of	of	ADP
cana-3401	111	13	92	92	NUM
cana-3401	111	14	%	%	NOUN
cana-3401	111	15	,	,	PUNCT
cana-3401	111	16	and	and	CCONJ
cana-3401	111	17	equally	equally	ADV
cana-3401	111	18	importantly	importantly	ADV
cana-3401	111	19	,	,	PUNCT
cana-3401	111	20	satisfies	satisfie	NOUN
cana-3401	111	21	constraints	constraint	VERB
cana-3401	111	22	not	not	PART
cana-3401	111	23	only	only	ADV
cana-3401	111	24	with	with	ADP
cana-3401	111	25	89	89	NUM
cana-3401	111	26	%	%	NOUN
cana-3401	111	27	success	success	NOUN
cana-3401	111	28	rate	rate	NOUN
cana-3401	111	29	but	but	CCONJ
cana-3401	111	30	also	also	ADV
cana-3401	111	31	performs	perform	VERB
cana-3401	111	32	better	well	ADJ
cana-3401	111	33	than	than	ADP
cana-3401	111	34	baseline	baseline	ADJ
cana-3401	111	35	methods	method	NOUN
cana-3401	111	36	and	and	CCONJ
cana-3401	111	37	handles	handle	VERB
cana-3401	111	38	higher	high	ADJ
cana-3401	111	39	k	k	PROPN
cana-3401	111	40	values	value	NOUN
cana-3401	111	41	successfully	successfully	ADV
cana-3401	111	42	.	.	PUNCT
cana-3401	112	1	table.4	table.4	ADJ
cana-3401	112	2	.	.	PUNCT
cana-3401	112	3	algorithm	algorithm	NOUN
cana-3401	112	4	robustness	robustness	NOUN
cana-3401	112	5	regarding	regard	VERB
cana-3401	112	6	constraints	constraint	NOUN
cana-3401	112	7	conclusion	conclusion	NOUN
cana-3401	112	8	in	in	ADP
cana-3401	112	9	this	this	DET
cana-3401	112	10	research	research	NOUN
cana-3401	112	11	,	,	PUNCT
cana-3401	112	12	we	we	PRON
cana-3401	112	13	extended	extend	VERB
cana-3401	112	14	this	this	DET
cana-3401	112	15	idea	idea	NOUN
cana-3401	112	16	within	within	ADP
cana-3401	112	17	the	the	DET
cana-3401	112	18	concept	concept	NOUN
cana-3401	112	19	of	of	ADP
cana-3401	112	20	ksecluded	ksecluded	ADJ
cana-3401	112	21	vertex	vertex	NOUN
cana-3401	112	22	sets	set	NOUN
cana-3401	112	23	,	,	PUNCT
cana-3401	112	24	a	a	DET
cana-3401	112	25	more	more	ADV
cana-3401	112	26	delicate	delicate	ADJ
cana-3401	112	27	way	way	NOUN
cana-3401	112	28	of	of	ADP
cana-3401	112	29	presenting	present	VERB
cana-3401	112	30	fuzzy	fuzzy	ADJ
cana-3401	112	31	graph	graph	NOUN
cana-3401	112	32	partitioning	partitioning	NOUN
cana-3401	112	33	and	and	CCONJ
cana-3401	112	34	connectivity	connectivity	NOUN
cana-3401	112	35	issues	issue	NOUN
cana-3401	112	36	,	,	PUNCT
cana-3401	112	37	especially	especially	ADV
cana-3401	112	38	in	in	ADP
cana-3401	112	39	the	the	DET
cana-3401	112	40	instances	instance	NOUN
cana-3401	112	41	containing	contain	VERB
cana-3401	112	42	forbidden	forbid	VERB
cana-3401	112	43	induced	induced	ADJ
cana-3401	112	44	subgraphs	subgraph	NOUN
cana-3401	112	45	.	.	PUNCT
cana-3401	113	1	therefore	therefore	ADV
cana-3401	113	2	,	,	PUNCT
cana-3401	113	3	based	base	VERB
cana-3401	113	4	on	on	ADP
cana-3401	113	5	the	the	DET
cana-3401	113	6	observation	observation	NOUN
cana-3401	113	7	of	of	ADP
cana-3401	113	8	vertex	vertex	NOUN
cana-3401	113	9	sets	set	NOUN
cana-3401	113	10	possess	possess	VERB
cana-3401	113	11	open	open	ADJ
cana-3401	113	12	neighborhoods	neighborhood	NOUN
cana-3401	113	13	limited	limit	VERB
cana-3401	113	14	to	to	ADP
cana-3401	113	15	at	at	ADP
cana-3401	113	16	most	most	ADJ
cana-3401	113	17	k	k	PROPN
cana-3401	113	18	vertices	vertex	NOUN
cana-3401	113	19	,	,	PUNCT
cana-3401	113	20	we	we	PRON
cana-3401	113	21	provided	provide	VERB
cana-3401	113	22	another	another	DET
cana-3401	113	23	way	way	NOUN
cana-3401	113	24	with	with	ADP
cana-3401	113	25	less	less	ADJ
cana-3401	113	26	computation	computation	NOUN
cana-3401	113	27	to	to	PART
cana-3401	113	28	find	find	VERB
cana-3401	113	29	the	the	DET
cana-3401	113	30	minimal	minimal	ADJ
cana-3401	113	31	separators	separator	NOUN
cana-3401	113	32	in	in	ADP
cana-3401	113	33	the	the	DET
cana-3401	113	34	graphs	graph	NOUN
cana-3401	113	35	with	with	ADP
cana-3401	113	36	intricate	intricate	ADJ
cana-3401	113	37	structure	structure	NOUN
cana-3401	113	38	requirements	requirement	NOUN
cana-3401	113	39	.	.	PUNCT
cana-3401	114	1	we	we	PRON
cana-3401	114	2	proved	prove	VERB
cana-3401	114	3	an	an	DET
cana-3401	114	4	important	important	ADJ
cana-3401	114	5	theoretical	theoretical	ADJ
cana-3401	114	6	proposition	proposition	NOUN
cana-3401	114	7	according	accord	VERB
cana-3401	114	8	to	to	ADP
cana-3401	114	9	which	which	PRON
cana-3401	114	10	the	the	DET
cana-3401	114	11	number	number	NOUN
cana-3401	114	12	of	of	ADP
cana-3401	114	13	maximal	maximal	ADJ
cana-3401	114	14	k	k	ADJ
cana-3401	114	15	-	-	ADJ
cana-3401	114	16	secluded	secluded	ADJ
cana-3401	114	17	connected	connected	ADJ
cana-3401	114	18	vertex	vertex	NOUN
cana-3401	114	19	sets	set	NOUN
cana-3401	114	20	containing	contain	VERB
cana-3401	114	21	a	a	DET
cana-3401	114	22	given	give	VERB
cana-3401	114	23	set	set	VERB
cana-3401	114	24	ss	ss	NOUN
cana-3401	114	25	and	and	CCONJ
cana-3401	114	26	disjoint	disjoint	VERB
cana-3401	114	27	to	to	ADP
cana-3401	114	28	another	another	DET
cana-3401	114	29	set	set	NOUN
cana-3401	114	30	t	t	PROPN
cana-3401	114	31	is	be	AUX
cana-3401	114	32	4k	4k	NUM
cana-3401	114	33	,	,	PUNCT
cana-3401	114	34	thus	thus	ADV
cana-3401	114	35	enhancing	enhance	VERB
cana-3401	114	36	significantly	significantly	ADV
cana-3401	114	37	previous	previous	ADJ
cana-3401	114	38	estimates	estimate	NOUN
cana-3401	114	39	.	.	PUNCT
cana-3401	115	1	this	this	DET
cana-3401	115	2	result	result	NOUN
cana-3401	115	3	is	be	AUX
cana-3401	115	4	fundamental	fundamental	ADJ
cana-3401	115	5	to	to	ADP
cana-3401	115	6	the	the	DET
cana-3401	115	7	lexicographic	lexicographic	ADJ
cana-3401	115	8	listing	listing	NOUN
cana-3401	115	9	of	of	ADP
cana-3401	115	10	these	these	DET
cana-3401	115	11	sets	set	NOUN
cana-3401	115	12	and	and	CCONJ
cana-3401	115	13	aids	aid	VERB
cana-3401	115	14	the	the	DET
cana-3401	115	15	establishment	establishment	NOUN
cana-3401	115	16	of	of	ADP
cana-3401	115	17	algorithms	algorithm	NOUN
cana-3401	115	18	that	that	PRON
cana-3401	115	19	can	can	AUX
cana-3401	115	20	solve	solve	VERB
cana-3401	115	21	such	such	ADJ
cana-3401	115	22	problems	problem	NOUN
cana-3401	115	23	within	within	ADP
cana-3401	115	24	large	large	ADJ
cana-3401	115	25	and	and	CCONJ
cana-3401	115	26	complicated	complicated	ADJ
cana-3401	115	27	graphs	graph	NOUN
cana-3401	115	28	.	.	PUNCT
cana-3401	116	1	moreover	moreover	ADV
cana-3401	116	2	,	,	PUNCT
cana-3401	116	3	pursuing	pursue	VERB
cana-3401	116	4	this	this	DET
cana-3401	116	5	idea	idea	NOUN
cana-3401	116	6	with	with	ADP
cana-3401	116	7	graphs	graph	NOUN
cana-3401	116	8	that	that	PRON
cana-3401	116	9	exclude	exclude	VERB
cana-3401	116	10	f	f	PROPN
cana-3401	116	11	,	,	PUNCT
cana-3401	116	12	a	a	DET
cana-3401	116	13	finite	finite	ADJ
cana-3401	116	14	list	list	NOUN
cana-3401	116	15	of	of	ADP
cana-3401	116	16	forbidden	forbid	VERB
cana-3401	116	17	induced	induced	ADJ
cana-3401	116	18	subgraphs	subgraph	NOUN
cana-3401	116	19	,	,	PUNCT
cana-3401	116	20	we	we	PRON
cana-3401	116	21	showed	show	VERB
cana-3401	116	22	that	that	SCONJ
cana-3401	116	23	among	among	ADP
cana-3401	116	24	the	the	DET
cana-3401	116	25	maximal	maximal	ADJ
cana-3401	116	26	subgraphs	subgraph	NOUN
cana-3401	116	27	the	the	DET
cana-3401	116	28	number	number	NOUN
cana-3401	116	29	does	do	AUX
cana-3401	116	30	not	not	PART
cana-3401	116	31	exceed	exceed	VERB
cana-3401	116	32	2o(k	2o(k	NUM
cana-3401	116	33	)	)	PUNCT
cana-3401	116	34	,	,	PUNCT
cana-3401	116	35	which	which	PRON
cana-3401	116	36	means	mean	VERB
cana-3401	116	37	that	that	SCONJ
cana-3401	116	38	even	even	ADV
cana-3401	116	39	in	in	ADP
cana-3401	116	40	a	a	DET
cana-3401	116	41	highly	highly	ADV
cana-3401	116	42	constrained	constrain	VERB
cana-3401	116	43	case	case	NOUN
cana-3401	116	44	the	the	DET
cana-3401	116	45	problem	problem	NOUN
cana-3401	116	46	remains	remain	VERB
cana-3401	116	47	solvable	solvable	ADJ
cana-3401	116	48	.	.	PUNCT
cana-3401	117	1	our	our	PRON
cana-3401	117	2	main	main	ADJ
cana-3401	117	3	contribution	contribution	NOUN
cana-3401	117	4	in	in	ADP
cana-3401	117	5	this	this	DET
cana-3401	117	6	research	research	NOUN
cana-3401	117	7	is	be	AUX
cana-3401	117	8	to	to	PART
cana-3401	117	9	propose	propose	VERB
cana-3401	117	10	a	a	DET
cana-3401	117	11	new	new	ADJ
cana-3401	117	12	enumeration	enumeration	NOUN
cana-3401	117	13	algorithm	algorithm	NOUN
cana-3401	117	14	for	for	ADP
cana-3401	117	15	enumerating	enumerate	VERB
cana-3401	117	16	the	the	DET
cana-3401	117	17	set	set	NOUN
cana-3401	117	18	of	of	ADP
cana-3401	117	19	all	all	DET
cana-3401	117	20	maximal	maximal	ADJ
cana-3401	117	21	ksecluded	kseclude	VERB
cana-3401	117	22	vertex	vertex	NOUN
cana-3401	117	23	sets	set	NOUN
cana-3401	117	24	in	in	ADP
cana-3401	117	25	linear	linear	ADJ
cana-3401	117	26	time	time	NOUN
cana-3401	117	27	.	.	PUNCT
cana-3401	118	1	this	this	PRON
cana-3401	118	2	has	have	AUX
cana-3401	118	3	been	be	AUX
cana-3401	118	4	proven	prove	VERB
cana-3401	118	5	through	through	ADP
cana-3401	118	6	tests	test	NOUN
cana-3401	118	7	with	with	ADP
cana-3401	118	8	our	our	PRON
cana-3401	118	9	algorithm	algorithm	NOUN
cana-3401	118	10	,	,	PUNCT
cana-3401	118	11	which	which	PRON
cana-3401	118	12	indeed	indeed	ADV
cana-3401	118	13	computed	compute	VERB
cana-3401	118	14	to	to	ADP
cana-3401	118	15	92	92	NUM
cana-3401	118	16	%	%	NOUN
cana-3401	118	17	,	,	PUNCT
cana-3401	118	18	a	a	DET
cana-3401	118	19	very	very	ADV
cana-3401	118	20	big	big	ADJ
cana-3401	118	21	improvement	improvement	NOUN
cana-3401	118	22	than	than	ADP
cana-3401	118	23	the	the	DET
cana-3401	118	24	70	70	NUM
cana-3401	118	25	%	%	NOUN
cana-3401	118	26	of	of	ADP
cana-3401	118	27	previous	previous	ADJ
cana-3401	118	28	methods	method	NOUN
cana-3401	118	29	.	.	PUNCT
cana-3401	119	1	communications	communication	NOUN
cana-3401	119	2	on	on	ADP
cana-3401	119	3	applied	apply	VERB
cana-3401	119	4	nonlinear	nonlinear	ADJ
cana-3401	119	5	analysis	analysis	NOUN
cana-3401	119	6	issn	issn	NOUN
cana-3401	119	7	:	:	PUNCT
cana-3401	119	8	1074	1074	NUM
cana-3401	119	9	-	-	PUNCT
cana-3401	119	10	133x	133x	NUM
cana-3401	119	11	vol	vol	NOUN
cana-3401	119	12	32	32	NUM
cana-3401	119	13	no	no	NOUN
cana-3401	119	14	.	.	PUNCT
cana-3401	120	1	7s	7	NOUN
cana-3401	120	2	(	(	PUNCT
cana-3401	120	3	2025	2025	NUM
cana-3401	120	4	)	)	PUNCT
cana-3401	120	5	304	304	NUM
cana-3401	120	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-3401	120	7	this	this	DET
cana-3401	120	8	breakthrough	breakthrough	NOUN
cana-3401	120	9	allows	allow	VERB
cana-3401	120	10	to	to	PART
cana-3401	120	11	solve	solve	VERB
cana-3401	120	12	the	the	DET
cana-3401	120	13	connected	connected	ADJ
cana-3401	120	14	k	k	ADJ
cana-3401	120	15	-	-	ADJ
cana-3401	120	16	secluded	secluded	ADJ
cana-3401	120	17	f	f	NOUN
cana-3401	120	18	-	-	PUNCT
cana-3401	120	19	free	free	ADJ
cana-3401	120	20	subgraph	subgraph	NOUN
cana-3401	120	21	problem	problem	NOUN
cana-3401	120	22	with	with	ADP
cana-3401	120	23	higher	high	ADJ
cana-3401	120	24	efficiency	efficiency	NOUN
cana-3401	120	25	,	,	PUNCT
cana-3401	120	26	which	which	PRON
cana-3401	120	27	is	be	AUX
cana-3401	120	28	necessary	necessary	ADJ
cana-3401	120	29	for	for	ADP
cana-3401	120	30	more	more	ADV
cana-3401	120	31	precise	precise	ADJ
cana-3401	120	32	division	division	NOUN
cana-3401	120	33	of	of	ADP
cana-3401	120	34	graphs	graph	NOUN
cana-3401	120	35	in	in	ADP
cana-3401	120	36	difficult	difficult	ADJ
cana-3401	120	37	conditions	condition	NOUN
cana-3401	120	38	.	.	PUNCT
cana-3401	121	1	references	reference	NOUN
cana-3401	121	2	[	[	X
cana-3401	121	3	1	1	NUM
cana-3401	121	4	]	]	PUNCT
cana-3401	121	5	m.	m.	NOUN
cana-3401	121	6	cygan	cygan	PROPN
cana-3401	121	7	,	,	PUNCT
cana-3401	121	8	d.	d.	PROPN
cana-3401	121	9	lokshtanov	lokshtanov	PROPN
cana-3401	121	10	,	,	PUNCT
cana-3401	121	11	m.	m.	NOUN
cana-3401	121	12	pilipczuk	pilipczuk	PROPN
cana-3401	121	13	,	,	PUNCT
cana-3401	121	14	m.	m.	NOUN
cana-3401	121	15	pilipczuk	pilipczuk	PROPN
cana-3401	121	16	,	,	PUNCT
cana-3401	121	17	s.	s.	PROPN
cana-3401	121	18	saurabh	saurabh	PROPN
cana-3401	121	19	,	,	PUNCT
cana-3401	121	20	minimum	minimum	ADJ
cana-3401	121	21	bisection	bisection	NOUN
cana-3401	121	22	is	be	AUX
cana-3401	121	23	fixed	fix	VERB
cana-3401	121	24	-	-	PUNCT
cana-3401	121	25	parameter	parameter	NOUN
cana-3401	121	26	tractable	tractable	ADJ
cana-3401	121	27	,	,	PUNCT
cana-3401	121	28	siamj	siamj	NOUN
cana-3401	121	29	.	.	PUNCT
cana-3401	122	1	comput	comput	NOUN
cana-3401	122	2	.	.	PUNCT
cana-3401	123	1	48	48	NUM
cana-3401	123	2	(	(	PUNCT
cana-3401	123	3	2	2	NUM
cana-3401	123	4	)	)	PUNCT
cana-3401	123	5	(	(	PUNCT
cana-3401	123	6	2019	2019	NUM
cana-3401	123	7	)	)	PUNCT
cana-3401	123	8	417–450,https://doi.org/10.1137/140988553	417–450,https://doi.org/10.1137/140988553	PROPN
cana-3401	123	9	.	.	PUNCT
cana-3401	124	1	[	[	X
cana-3401	124	2	2	2	NUM
cana-3401	124	3	]	]	PUNCT
cana-3401	124	4	m.	m.	NOUN
cana-3401	124	5	cygan	cygan	NOUN
cana-3401	124	6	,	,	PUNCT
cana-3401	124	7	p.	p.	PROPN
cana-3401	124	8	komosa	komosa	PROPN
cana-3401	124	9	,	,	PUNCT
cana-3401	124	10	d.	d.	PROPN
cana-3401	124	11	lokshtanov	lokshtanov	PROPN
cana-3401	124	12	,	,	PUNCT
cana-3401	124	13	m.	m.	NOUN
cana-3401	124	14	pilipczuk	pilipczuk	PROPN
cana-3401	124	15	,	,	PUNCT
cana-3401	124	16	m.	m.	NOUN
cana-3401	124	17	pilipczuk	pilipczuk	PROPN
cana-3401	124	18	,	,	PUNCT
cana-3401	124	19	s.	s.	PROPN
cana-3401	124	20	saurabh	saurabh	PROPN
cana-3401	124	21	,	,	PUNCT
cana-3401	124	22	m.	m.	NOUN
cana-3401	124	23	wahlström	wahlström	PROPN
cana-3401	124	24	,	,	PUNCT
cana-3401	124	25	randomized	randomize	VERB
cana-3401	124	26	contractions	contraction	NOUN
cana-3401	124	27	meet	meet	VERB
cana-3401	124	28	lean	lean	ADJ
cana-3401	124	29	decompositions	decomposition	NOUN
cana-3401	124	30	,	,	PUNCT
cana-3401	124	31	acm	acm	PROPN
cana-3401	124	32	trans	trans	PROPN
cana-3401	124	33	.	.	PUNCT
cana-3401	125	1	algorithms	algorithms	PROPN
cana-3401	125	2	17	17	NUM
cana-3401	125	3	(	(	PUNCT
cana-3401	125	4	1	1	NUM
cana-3401	125	5	)	)	PUNCT
cana-3401	125	6	(	(	PUNCT
cana-3401	125	7	2021	2021	NUM
cana-3401	125	8	)	)	PUNCT
cana-3401	125	9	6:1–6:30	6:1–6:30	NUM
cana-3401	125	10	,	,	PUNCT
cana-3401	125	11	https://doi.org/10.1145/3426738	https://doi.org/10.1145/3426738	NOUN
cana-3401	125	12	.	.	PUNCT
cana-3401	126	1	[	[	X
cana-3401	126	2	3	3	NUM
cana-3401	126	3	]	]	X
cana-3401	126	4	e.j	e.j	PROPN
cana-3401	126	5	.	.	PROPN
cana-3401	126	6	kim	kim	PROPN
cana-3401	126	7	,	,	PUNCT
cana-3401	126	8	s.	s.	PROPN
cana-3401	126	9	kratsch	kratsch	PROPN
cana-3401	126	10	,	,	PUNCT
cana-3401	126	11	m.	m.	NOUN
cana-3401	126	12	pilipczuk	pilipczuk	PROPN
cana-3401	126	13	,	,	PUNCT
cana-3401	126	14	m.	m.	NOUN
cana-3401	126	15	wahlström	wahlström	NOUN
cana-3401	126	16	,	,	PUNCT
cana-3401	126	17	solving	solve	VERB
cana-3401	126	18	hard	hard	ADJ
cana-3401	126	19	cut	cut	VERB
cana-3401	126	20	problems	problem	NOUN
cana-3401	126	21	via	via	ADP
cana-3401	126	22	flow	flow	NOUN
cana-3401	126	23	-	-	PUNCT
cana-3401	126	24	augmentation	augmentation	NOUN
cana-3401	126	25	,	,	PUNCT
cana-3401	126	26	in	in	ADP
cana-3401	126	27	:	:	PUNCT
cana-3401	126	28	d.	d.	PROPN
cana-3401	126	29	marx	marx	PROPN
cana-3401	126	30	(	(	PUNCT
cana-3401	126	31	ed	ed	NOUN
cana-3401	126	32	.	.	PUNCT
cana-3401	126	33	)	)	PUNCT
cana-3401	126	34	,	,	PUNCT
cana-3401	126	35	proceedings	proceeding	NOUN
cana-3401	126	36	of	of	ADP
cana-3401	126	37	the	the	DET
cana-3401	126	38	2021	2021	NUM
cana-3401	126	39	acm	acm	NOUN
cana-3401	126	40	-	-	PUNCT
cana-3401	126	41	siam	siam	NOUN
cana-3401	126	42	symposium	symposium	NOUN
cana-3401	126	43	on	on	ADP
cana-3401	126	44	discrete	discrete	ADJ
cana-3401	126	45	algorithms	algorithm	NOUN
cana-3401	126	46	,	,	PUNCT
cana-3401	126	47	soda	soda	NOUN
cana-3401	126	48	2021	2021	NUM
cana-3401	126	49	,	,	PUNCT
cana-3401	126	50	virtual	virtual	ADJ
cana-3401	126	51	conference	conference	NOUN
cana-3401	126	52	,	,	PUNCT
cana-3401	126	53	january	january	PROPN
cana-3401	126	54	10	10	NUM
cana-3401	126	55	13,2021	13,2021	NUM
cana-3401	126	56	,	,	PUNCT
cana-3401	126	57	siam	siam	NOUN
cana-3401	126	58	,	,	PUNCT
cana-3401	126	59	2021	2021	NUM
cana-3401	126	60	,	,	PUNCT
cana-3401	126	61	pp	pp	ADV
cana-3401	126	62	.	.	PUNCT
cana-3401	127	1	149–168	149–168	NUM
cana-3401	127	2	.	.	PUNCT
cana-3401	128	1	[	[	X
cana-3401	128	2	4	4	NUM
cana-3401	128	3	]	]	X
cana-3401	128	4	e.j	e.j	PROPN
cana-3401	128	5	.	.	PROPN
cana-3401	128	6	kim	kim	PROPN
cana-3401	128	7	,	,	PUNCT
cana-3401	128	8	s.	s.	PROPN
cana-3401	128	9	kratsch	kratsch	PROPN
cana-3401	128	10	,	,	PUNCT
cana-3401	128	11	m.	m.	NOUN
cana-3401	128	12	pilipczuk	pilipczuk	PROPN
cana-3401	128	13	,	,	PUNCT
cana-3401	128	14	m.	m.	NOUN
cana-3401	128	15	wahlström	wahlström	NOUN
cana-3401	128	16	,	,	PUNCT
cana-3401	128	17	directed	direct	VERB
cana-3401	128	18	flow	flow	NOUN
cana-3401	128	19	-	-	PUNCT
cana-3401	128	20	augmentation	augmentation	NOUN
cana-3401	128	21	,	,	PUNCT
cana-3401	128	22	in	in	ADP
cana-3401	128	23	:	:	PUNCT
cana-3401	128	24	s.	s.	PROPN
cana-3401	128	25	leonardi	leonardi	PROPN
cana-3401	128	26	,	,	PUNCT
cana-3401	128	27	a.	a.	PROPN
cana-3401	128	28	gupta	gupta	PROPN
cana-3401	128	29	(	(	PUNCT
cana-3401	128	30	eds	ed	NOUN
cana-3401	128	31	.	.	PUNCT
cana-3401	128	32	)	)	PUNCT
cana-3401	128	33	,	,	PUNCT
cana-3401	128	34	stoc	stoc	VERB
cana-3401	128	35	‘	'	PUNCT
cana-3401	128	36	22	22	NUM
cana-3401	128	37	:	:	PUNCT
cana-3401	128	38	54th	54th	ADJ
cana-3401	128	39	annual	annual	ADJ
cana-3401	128	40	acm	acm	NOUN
cana-3401	128	41	sigact	sigact	NOUN
cana-3401	128	42	symposium	symposium	NOUN
cana-3401	128	43	on	on	ADP
cana-3401	128	44	theory	theory	NOUN
cana-3401	128	45	of	of	ADP
cana-3401	128	46	computing	computing	NOUN
cana-3401	128	47	,	,	PUNCT
cana-3401	128	48	rome	rome	PROPN
cana-3401	128	49	,	,	PUNCT
cana-3401	128	50	italy	italy	PROPN
cana-3401	128	51	,	,	PUNCT
cana-3401	128	52	june	june	PROPN
cana-3401	128	53	20	20	NUM
cana-3401	128	54	24	24	NUM
cana-3401	128	55	,	,	PUNCT
cana-3401	128	56	2022	2022	NUM
cana-3401	128	57	,	,	PUNCT
cana-3401	128	58	acm	acm	NOUN
cana-3401	128	59	,	,	PUNCT
cana-3401	128	60	2022	2022	NUM
cana-3401	128	61	,	,	PUNCT
cana-3401	128	62	pp.938–947	pp.938–947	ADJ
cana-3401	128	63	[	[	X
cana-3401	128	64	5	5	NUM
cana-3401	128	65	]	]	X
cana-3401	128	66	h.l	h.l	PROPN
cana-3401	128	67	.	.	PROPN
cana-3401	128	68	bodlaender	bodlaender	PROPN
cana-3401	128	69	,	,	PUNCT
cana-3401	128	70	a.	a.	NOUN
cana-3401	128	71	dawar	dawar	NOUN
cana-3401	128	72	,	,	PUNCT
cana-3401	128	73	v.v	v.v	PROPN
cana-3401	128	74	.	.	PROPN
cana-3401	128	75	williams	williams	PROPN
cana-3401	128	76	,	,	PUNCT
cana-3401	128	77	eatcs	eatcs	NOUN
cana-3401	128	78	-	-	PUNCT
cana-3401	128	79	ipec	ipec	PROPN
cana-3401	128	80	nerode	nerode	PROPN
cana-3401	128	81	prize	prize	PROPN
cana-3401	128	82	,	,	PUNCT
cana-3401	128	83	2020	2020	NUM
cana-3401	128	84	(	(	PUNCT
cana-3401	128	85	2020	2020	NUM
cana-3401	128	86	)	)	PUNCT
cana-3401	128	87	,	,	PUNCT
cana-3401	128	88	https://eatcs.org/index.php/component/content/article/1news/2861eatcs-ipec-nerode-prize-2020-	https://eatcs.org/index.php/component/content/article/1news/2861eatcs-ipec-nerode-prize-2020-	PROPN
cana-3401	128	89	.	.	PUNCT
cana-3401	129	1	[	[	X
cana-3401	129	2	6	6	NUM
cana-3401	129	3	]	]	PUNCT
cana-3401	129	4	d.	d.	PROPN
cana-3401	129	5	lokshtanov	lokshtanov	PROPN
cana-3401	129	6	,	,	PUNCT
cana-3401	129	7	f.	f.	PROPN
cana-3401	129	8	panolan	panolan	PROPN
cana-3401	129	9	,	,	PUNCT
cana-3401	129	10	s.	s.	PROPN
cana-3401	129	11	saurabh	saurabh	PROPN
cana-3401	129	12	,	,	PUNCT
cana-3401	129	13	r.	r.	PROPN
cana-3401	129	14	sharma	sharma	PROPN
cana-3401	129	15	,	,	PUNCT
cana-3401	129	16	m.	m.	NOUN
cana-3401	129	17	zehavi	zehavi	PROPN
cana-3401	129	18	,	,	PUNCT
cana-3401	129	19	covering	cover	VERB
cana-3401	129	20	small	small	ADJ
cana-3401	129	21	independent	independent	ADJ
cana-3401	129	22	sets	set	NOUN
cana-3401	129	23	and	and	CCONJ
cana-3401	129	24	separators	separator	NOUN
cana-3401	129	25	with	with	ADP
cana-3401	129	26	applications	application	NOUN
cana-3401	129	27	to	to	ADP
cana-3401	129	28	parameterized	parameterized	ADJ
cana-3401	129	29	algorithms	algorithm	NOUN
cana-3401	129	30	,	,	PUNCT
cana-3401	129	31	acm	acm	PROPN
cana-3401	129	32	trans	trans	PROPN
cana-3401	129	33	.	.	PUNCT
cana-3401	130	1	algorithms	algorithms	PROPN
cana-3401	130	2	16	16	NUM
cana-3401	130	3	(	(	PUNCT
cana-3401	130	4	3	3	NUM
cana-3401	130	5	)	)	PUNCT
cana-3401	130	6	(	(	PUNCT
cana-3401	130	7	2020	2020	NUM
cana-3401	130	8	)	)	PUNCT
cana-3401	130	9	32:1–32:31	32:1–32:31	NUM
cana-3401	130	10	,	,	PUNCT
cana-3401	130	11	https://doi.org/10.1145/3379698	https://doi.org/10.1145/3379698	NOUN
cana-3401	130	12	.	.	PUNCT
cana-3401	131	1	[	[	X
cana-3401	131	2	7	7	X
cana-3401	131	3	]	]	X
cana-3401	131	4	r.	r.	PROPN
cana-3401	131	5	bevern	bevern	PROPN
cana-3401	131	6	,	,	PUNCT
cana-3401	131	7	t.	t.	NOUN
cana-3401	131	8	fluschnik	fluschnik	NOUN
cana-3401	131	9	,	,	PUNCT
cana-3401	131	10	o.y	o.y	PROPN
cana-3401	131	11	.	.	PROPN
cana-3401	131	12	tsidulko	tsidulko	PROPN
cana-3401	131	13	,	,	PUNCT
cana-3401	131	14	parameterized	parameterized	ADJ
cana-3401	131	15	algorithms	algorithm	NOUN
cana-3401	131	16	and	and	CCONJ
cana-3401	131	17	data	data	NOUN
cana-3401	131	18	reduction	reduction	NOUN
cana-3401	131	19	for	for	ADP
cana-3401	131	20	the	the	DET
cana-3401	131	21	short	short	ADJ
cana-3401	131	22	,	,	PUNCT
cana-3401	131	23	secluded	secluded	ADJ
cana-3401	131	24	s	s	PROPN
cana-3401	131	25	-	-	PUNCT
cana-3401	131	26	t	t	NOUN
cana-3401	131	27	-	-	PUNCT
cana-3401	131	28	path	path	NOUN
cana-3401	131	29	problem	problem	NOUN
cana-3401	131	30	,	,	PUNCT
cana-3401	131	31	networks	network	NOUN
cana-3401	131	32	75	75	NUM
cana-3401	131	33	(	(	PUNCT
cana-3401	131	34	1	1	NUM
cana-3401	131	35	)	)	PUNCT
cana-3401	131	36	(	(	PUNCT
cana-3401	131	37	2020	2020	NUM
cana-3401	131	38	)	)	PUNCT
cana-3401	131	39	34–63	34–63	NUM
cana-3401	131	40	,	,	PUNCT
cana-3401	131	41	https://doi.org/10.1002/net.21904	https://doi.org/10.1002/net.21904	PROPN
cana-3401	131	42	.	.	PUNCT
cana-3401	132	1	[	[	X
cana-3401	132	2	8	8	NUM
cana-3401	132	3	]	]	PUNCT
cana-3401	132	4	m.	m.	NOUN
cana-3401	132	5	luckow	luckow	NOUN
cana-3401	132	6	,	,	PUNCT
cana-3401	132	7	t.	t.	NOUN
cana-3401	132	8	fluschnik	fluschnik	NOUN
cana-3401	132	9	,	,	PUNCT
cana-3401	132	10	on	on	ADP
cana-3401	132	11	the	the	DET
cana-3401	132	12	computational	computational	ADJ
cana-3401	132	13	complexity	complexity	NOUN
cana-3401	132	14	of	of	ADP
cana-3401	132	15	lengthand	lengthand	PROPN
cana-3401	132	16	neighborhood	neighborhood	NOUN
cana-3401	132	17	-	-	PUNCT
cana-3401	132	18	constrained	constrain	VERB
cana-3401	132	19	path	path	NOUN
cana-3401	132	20	problems	problem	NOUN
cana-3401	132	21	,	,	PUNCT
cana-3401	132	22	inf	inf	PROPN
cana-3401	132	23	.	.	PROPN
cana-3401	132	24	process	process	NOUN
cana-3401	132	25	.	.	PUNCT
cana-3401	133	1	lett	lett	PROPN
cana-3401	133	2	.	.	PUNCT
cana-3401	134	1	156	156	NUM
cana-3401	134	2	(	(	PUNCT
cana-3401	134	3	2020	2020	NUM
cana-3401	134	4	)	)	PUNCT
cana-3401	134	5	105913	105913	NUM
cana-3401	134	6	,	,	PUNCT
cana-3401	134	7	https://doi.org/10.1016/j.ipl.2019.105913	https://doi.org/10.1016/j.ipl.2019.105913	PROPN
cana-3401	134	8	.	.	PUNCT
cana-3401	135	1	[	[	X
cana-3401	135	2	9	9	NUM
cana-3401	135	3	]	]	X
cana-3401	135	4	h.	h.	NOUN
cana-3401	135	5	donkers	donker	NOUN
cana-3401	135	6	,	,	PUNCT
cana-3401	135	7	b.m.p	b.m.p	PROPN
cana-3401	135	8	.	.	PUNCT
cana-3401	135	9	jansen	jansen	PROPN
cana-3401	135	10	,	,	PUNCT
cana-3401	135	11	j.j.h	j.j.h	NOUN
cana-3401	135	12	.	.	PUNCT
cana-3401	135	13	de	de	PROPN
cana-3401	135	14	kroon	kroon	PROPN
cana-3401	135	15	,	,	PUNCT
cana-3401	135	16	finding	find	VERB
cana-3401	135	17	ksecluded	kseclude	VERB
cana-3401	135	18	trees	tree	NOUN
cana-3401	135	19	faster	fast	ADV
cana-3401	135	20	,	,	PUNCT
cana-3401	135	21	j.	j.	PROPN
cana-3401	135	22	comput	comput	PROPN
cana-3401	135	23	.	.	PUNCT
cana-3401	136	1	syst	syst	PROPN
cana-3401	136	2	.	.	PUNCT
cana-3401	137	1	sci	sci	PROPN
cana-3401	137	2	.	.	PROPN
cana-3401	138	1	138	138	NUM
cana-3401	138	2	(	(	PUNCT
cana-3401	138	3	2023	2023	NUM
cana-3401	138	4	)	)	PUNCT
cana-3401	138	5	103461	103461	NUM
cana-3401	138	6	,	,	PUNCT
cana-3401	138	7	https://doi.org/10.1016/j.jcss.2023.05.006	https://doi.org/10.1016/j.jcss.2023.05.006	NOUN
cana-3401	138	8	.	.	PUNCT
cana-3401	139	1	[	[	X
cana-3401	139	2	10	10	NUM
cana-3401	139	3	]	]	X
cana-3401	139	4	r.	r.	PROPN
cana-3401	139	5	bevern	bevern	PROPN
cana-3401	139	6	,	,	PUNCT
cana-3401	139	7	t.	t.	NOUN
cana-3401	139	8	fluschnik	fluschnik	NOUN
cana-3401	139	9	,	,	PUNCT
cana-3401	139	10	g.b	g.b	PROPN
cana-3401	139	11	.	.	PROPN
cana-3401	139	12	mertzios	mertzio	NOUN
cana-3401	139	13	,	,	PUNCT
cana-3401	139	14	h.	h.	PROPN
cana-3401	139	15	molter	molter	PROPN
cana-3401	139	16	,	,	PUNCT
cana-3401	139	17	m.	m.	NOUN
cana-3401	139	18	sorge	sorge	PROPN
cana-3401	139	19	,	,	PUNCT
cana-3401	139	20	o.	o.	PROPN
cana-3401	139	21	suchý	suchý	PROPN
cana-3401	139	22	,	,	PUNCT
cana-3401	139	23	the	the	DET
cana-3401	139	24	parameterized	parameterized	ADJ
cana-3401	139	25	complexity	complexity	NOUN
cana-3401	139	26	of	of	ADP
cana-3401	139	27	finding	find	VERB
cana-3401	139	28	secluded	secluded	ADJ
cana-3401	139	29	solutions	solution	NOUN
cana-3401	139	30	to	to	ADP
cana-3401	139	31	some	some	DET
cana-3401	139	32	classical	classical	ADJ
cana-3401	139	33	optimization	optimization	NOUN
cana-3401	139	34	problems	problem	NOUN
cana-3401	139	35	on	on	ADP
cana-3401	139	36	graphs	graph	NOUN
cana-3401	139	37	,	,	PUNCT
cana-3401	139	38	discrete	discrete	ADJ
cana-3401	139	39	optim	optim	ADJ
cana-3401	139	40	.	.	PUNCT
cana-3401	140	1	30	30	NUM
cana-3401	140	2	(	(	PUNCT
cana-3401	140	3	2018	2018	NUM
cana-3401	140	4	)	)	PUNCT
cana-3401	140	5	20	20	NUM
cana-3401	140	6	–	–	PUNCT
cana-3401	140	7	50	50	NUM
cana-3401	140	8	,	,	PUNCT
cana-3401	140	9	https://doi.org/10.1016/j.disopt.2018.05.002	https://doi.org/10.1016/j.disopt.2018.05.002	NOUN
cana-3401	140	10	.	.	PUNCT
cana-3401	141	1	[	[	X
cana-3401	141	2	11	11	NUM
cana-3401	141	3	]	]	X
cana-3401	141	4	p.a	p.a	PROPN
cana-3401	141	5	.	.	PUNCT
cana-3401	141	6	golovach	golovach	PROPN
cana-3401	141	7	,	,	PUNCT
cana-3401	141	8	p.	p.	PROPN
cana-3401	141	9	heggernes	heggernes	PROPN
cana-3401	141	10	,	,	PUNCT
cana-3401	141	11	p.t	p.t	PROPN
cana-3401	141	12	.	.	PROPN
cana-3401	141	13	lima	lima	PROPN
cana-3401	141	14	,	,	PUNCT
cana-3401	141	15	p.	p.	NOUN
cana-3401	141	16	montealegre	montealegre	PROPN
cana-3401	141	17	,	,	PUNCT
cana-3401	141	18	finding	find	VERB
cana-3401	141	19	connected	connect	VERB
cana-3401	141	20	secluded	secluded	ADJ
cana-3401	141	21	subgraphs	subgraph	NOUN
cana-3401	141	22	,	,	PUNCT
cana-3401	141	23	j.	j.	PROPN
cana-3401	141	24	comput	comput	PROPN
cana-3401	141	25	.	.	PUNCT
cana-3401	142	1	syst	syst	PROPN
cana-3401	142	2	.	.	PUNCT
cana-3401	143	1	sci	sci	PROPN
cana-3401	143	2	.	.	PROPN
cana-3401	143	3	113	113	NUM
cana-3401	143	4	(	(	PUNCT
cana-3401	143	5	2020	2020	NUM
cana-3401	143	6	)	)	PUNCT
cana-3401	144	1	101–124	101–124	NUM
cana-3401	144	2	,	,	PUNCT
cana-3401	144	3	https://doi.org/10.1016/j.jcss.2020.05.006	https://doi.org/10.1016/j.jcss.2020.05.006	NOUN
cana-3401	144	4	.	.	PUNCT
cana-3401	145	1	[	[	X
cana-3401	145	2	12	12	NUM
cana-3401	145	3	]	]	X
cana-3401	145	4	r.	r.	PROPN
cana-3401	145	5	ganian	ganian	PROPN
cana-3401	145	6	,	,	PUNCT
cana-3401	145	7	m.s	m.s	PROPN
cana-3401	145	8	.	.	PROPN
cana-3401	145	9	ramanujan	ramanujan	PROPN
cana-3401	145	10	,	,	PUNCT
cana-3401	145	11	s.	s.	PROPN
cana-3401	145	12	szeider	szeider	PROPN
cana-3401	145	13	,	,	PUNCT
cana-3401	145	14	discovering	discover	VERB
cana-3401	145	15	archipelagos	archipelago	NOUN
cana-3401	145	16	of	of	ADP
cana-3401	145	17	tractability	tractability	NOUN
cana-3401	145	18	for	for	ADP
cana-3401	145	19	constraint	constraint	NOUN
cana-3401	145	20	satisfaction	satisfaction	NOUN
cana-3401	145	21	and	and	CCONJ
cana-3401	145	22	counting	counting	NOUN
cana-3401	145	23	,	,	PUNCT
cana-3401	145	24	acm	acm	PROPN
cana-3401	145	25	trans	trans	PROPN
cana-3401	145	26	.	.	PUNCT
cana-3401	146	1	algorithms	algorithms	PROPN
cana-3401	146	2	13	13	NUM
cana-3401	146	3	(	(	PUNCT
cana-3401	146	4	2)(2017	2)(2017	NUM
cana-3401	146	5	)	)	PUNCT
cana-3401	146	6	29:1–29:32	29:1–29:32	NUM
cana-3401	146	7	,	,	PUNCT
cana-3401	146	8	https://doi.org/10.1145/3014587	https://doi.org/10.1145/3014587	X
cana-3401	146	9	.	.	PUNCT
cana-3401	147	1	[	[	X
cana-3401	147	2	13	13	NUM
cana-3401	147	3	]	]	PUNCT
cana-3401	147	4	a.	a.	NOUN
cana-3401	147	5	jacob	jacob	PROPN
cana-3401	147	6	,	,	PUNCT
cana-3401	147	7	j.j.h	j.j.h	NOUN
cana-3401	147	8	.	.	PUNCT
cana-3401	147	9	de	de	PROPN
cana-3401	147	10	kroon	kroon	PROPN
cana-3401	147	11	,	,	PUNCT
cana-3401	147	12	d.	d.	PROPN
cana-3401	147	13	majumdar	majumdar	PROPN
cana-3401	147	14	,	,	PUNCT
cana-3401	147	15	v.	v.	ADP
cana-3401	147	16	raman	raman	NOUN
cana-3401	147	17	,	,	PUNCT
cana-3401	147	18	deletion	deletion	NOUN
cana-3401	147	19	to	to	ADP
cana-3401	147	20	scattered	scatter	VERB
cana-3401	147	21	graph	graph	NOUN
cana-3401	147	22	classes	class	NOUN
cana-3401	147	23	i	i	PRON
cana-3401	147	24	case	case	NOUN
cana-3401	147	25	of	of	ADP
cana-3401	147	26	finite	finite	ADJ
cana-3401	147	27	number	number	NOUN
cana-3401	147	28	of	of	ADP
cana-3401	147	29	graph	graph	NOUN
cana-3401	147	30	classes	class	NOUN
cana-3401	147	31	,	,	PUNCT
cana-3401	147	32	j.	j.	PROPN
cana-3401	147	33	comput	comput	PROPN
cana-3401	147	34	.	.	PUNCT
cana-3401	148	1	syst	syst	PROPN
cana-3401	148	2	.	.	PUNCT
cana-3401	149	1	sci	sci	PROPN
cana-3401	149	2	.	.	PROPN
cana-3401	150	1	138	138	NUM
cana-3401	150	2	(	(	PUNCT
cana-3401	150	3	2023	2023	NUM
cana-3401	150	4	)	)	PUNCT
cana-3401	150	5	103460	103460	NUM
cana-3401	150	6	,	,	PUNCT
cana-3401	150	7	https://doi.org/10.1016/j.jcss.2023.05.005	https://doi.org/10.1016/j.jcss.2023.05.005	PROPN
cana-3401	150	8	.	.	PUNCT
cana-3401	151	1	[	[	X
cana-3401	151	2	14	14	NUM
cana-3401	151	3	]	]	PUNCT
cana-3401	151	4	a.	a.	NOUN
cana-3401	151	5	jacob	jacob	PROPN
cana-3401	151	6	,	,	PUNCT
cana-3401	151	7	d.	d.	PROPN
cana-3401	151	8	majumdar	majumdar	PROPN
cana-3401	151	9	,	,	PUNCT
cana-3401	151	10	v.	v.	ADP
cana-3401	151	11	raman	raman	NOUN
cana-3401	151	12	,	,	PUNCT
cana-3401	151	13	deletion	deletion	NOUN
cana-3401	151	14	to	to	ADP
cana-3401	151	15	scattered	scatter	VERB
cana-3401	151	16	graph	graph	NOUN
cana-3401	151	17	classes	class	NOUN
cana-3401	151	18	ii	ii	PROPN
cana-3401	151	19	improved	improve	VERB
cana-3401	151	20	fpt	fpt	PROPN
cana-3401	151	21	algorithms	algorithm	NOUN
cana-3401	151	22	for	for	ADP
cana-3401	151	23	deletion	deletion	NOUN
cana-3401	151	24	to	to	ADP
cana-3401	151	25	pairs	pair	NOUN
cana-3401	151	26	of	of	ADP
cana-3401	151	27	graph	graph	NOUN
cana-3401	151	28	classes	class	NOUN
cana-3401	151	29	,	,	PUNCT
cana-3401	151	30	j.	j.	PROPN
cana-3401	151	31	comput	comput	PROPN
cana-3401	151	32	.	.	PUNCT
cana-3401	152	1	syst	syst	PROPN
cana-3401	152	2	.	.	PUNCT
cana-3401	153	1	sci	sci	PROPN
cana-3401	153	2	.	.	PROPN
cana-3401	154	1	136	136	NUM
cana-3401	154	2	(	(	PUNCT
cana-3401	154	3	2023	2023	NUM
cana-3401	154	4	)	)	PUNCT
cana-3401	155	1	280–301	280–301	NUM
cana-3401	155	2	,	,	PUNCT
cana-3401	155	3	https://doi.org/10.1016/j.jcss.2023.03.004	https://doi.org/10.1016/j.jcss.2023.03.004	NOUN
cana-3401	155	4	.	.	PUNCT
cana-3401	156	1	[	[	X
cana-3401	156	2	15	15	NUM
cana-3401	156	3	]	]	X
cana-3401	156	4	s.	s.	PROPN
cana-3401	156	5	kratsch	kratsch	PROPN
cana-3401	156	6	,	,	PUNCT
cana-3401	156	7	m.	m.	NOUN
cana-3401	156	8	wahlström	wahlström	NOUN
cana-3401	156	9	,	,	PUNCT
cana-3401	156	10	representative	representative	ADJ
cana-3401	156	11	sets	set	NOUN
cana-3401	156	12	and	and	CCONJ
cana-3401	156	13	irrelevant	irrelevant	ADJ
cana-3401	156	14	vertices	vertex	NOUN
cana-3401	156	15	:	:	PUNCT
cana-3401	156	16	new	new	ADJ
cana-3401	156	17	tools	tool	NOUN
cana-3401	156	18	for	for	ADP
cana-3401	156	19	kernelization	kernelization	NOUN
cana-3401	156	20	,	,	PUNCT
cana-3401	156	21	j.	j.	PROPN
cana-3401	156	22	acm	acm	PROPN
cana-3401	156	23	67	67	NUM
cana-3401	156	24	(	(	PUNCT
cana-3401	156	25	3	3	NUM
cana-3401	156	26	)	)	PUNCT
cana-3401	156	27	(	(	PUNCT
cana-3401	156	28	2020	2020	NUM
cana-3401	156	29	)	)	PUNCT
cana-3401	156	30	16:1–16:50	16:1–16:50	NUM
cana-3401	156	31	,	,	PUNCT
cana-3401	156	32	https://doi.org/10.1145/3390887	https://doi.org/10.1145/3390887	NUM
cana-3401	156	33	.	.	PUNCT
cana-3401	157	1	https://doi.org/10.1137/140988553	https://doi.org/10.1137/140988553	NOUN
cana-3401	157	2	https://doi.org/10.1145/3426738	https://doi.org/10.1145/3426738	X
cana-3401	157	3	https://eatcs.org/index.php/component/content/article/1-news/2861https://eatcs.org/index.php/component/content/article/1-news/2861https://doi.org/10.1002/net.21904	https://eatcs.org/index.php/component/content/article/1-news/2861https://eatcs.org/index.php/component/content/article/1-news/2861https://doi.org/10.1002/net.21904	VERB
cana-3401	157	4	https://doi.org/10.1016/j.jcss.2023.05.006	https://doi.org/10.1016/j.jcss.2023.05.006	NOUN