Search results for "NLC-width"

Found 17 publication records. Showing 17 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
178	Frank Gurski, Egon Wanke	Minimizing NLC-Width is NP-Complete.	WG	2005	DBLP DOI BibTeX RDF
150	Frank Gurski, Egon Wanke	The Clique-Width of Tree-Power and Leaf-Power Graphs.	WG	2007	DBLP DOI BibTeX RDF	tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers
141	Öjvind Johansson	log n-Approximative NLCk-Decomposition in O(n2k+1) Time.	WG	2001	DBLP DOI BibTeX RDF
135	Öjvind Johansson	NLC2-Decomposition in Polynomial Time.	WG	1999	DBLP DOI BibTeX RDF
81	Bruno Courcelle, Mamadou Moustapha Kanté	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.	WG	2007	DBLP DOI BibTeX RDF
78	Vincent Limouzy, Fabien de Montgolfier, Michaël Rao	NLC-2 Graph Recognition and Isomorphism.	WG	2007	DBLP DOI BibTeX RDF
72	Frank Gurski, Egon Wanke	On the relationship between NLC-width and linear NLC-width.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
57	Frank Gurski, Egon Wanke	The NLC-width and clique-width for powers of graphs of bounded tree-width.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
47	Karol Suchan, Ioan Todinca	On powers of graphs of bounded NLC-width (clique-width).	Discret. Appl. Math.	2007	DBLP DOI BibTeX RDF
47	Frank Gurski	Characterizations for co-graphs defined by restricted NLC-width or clique-width operations.	Discret. Math.	2006	DBLP DOI BibTeX RDF
42	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
37	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Feedback Vertex Set on Graphs of Low Cliquewidth.	IWOCA	2009	DBLP DOI BibTeX RDF
36	Frank Gurski, Egon Wanke, Eda Yilmaz	Directed NLC-width.	Theor. Comput. Sci.	2016	DBLP DOI BibTeX RDF
36	Hans L. Bodlaender, Jurriaan Hage	On switching classes, NLC-width, cliquewidth and treewidth.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
36	Haiko Müller, Ruth Urner	On a disparity between relative cliquewidth and relative NLC-width.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
36	Frank Gurski	Characterizations for restricted graphs of NLC-width 2.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
31	Wolfgang Espelage, Frank Gurski, Egon Wanke	How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.	WG	2001	DBLP DOI BibTeX RDF

Displaying result #1 - #17 of 17 (100 per page; Change: )