Split graph - PDFSEARCH.IO - Document Search Engine

Split graph
Results: 35

#	Item
1	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-01-06 11:50:35 Graph theory Bipartite graphs Graph operations NP-complete problems Chordal bipartite graph Chordal graph Distance-hereditary graph Matching Line graph Split graph Graph Cycle
2	Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2011-07-20 16:48:47 Graph theory Graph operations NP-complete problems Chordal graph Clique Graph minor Edge contraction Tree decomposition Vertex Split graph Graph Independent set
3	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2014-01-31 12:40:59 Graph theory NP-complete problems Circular-arc graph Hamiltonian path Intersection graph Graph Path Interval graph Chordal graph Indifference graph Longest path problem Split graph
4	Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2012-06-08 03:17:45 Clique-width Graph theory Split graph Graph coloring Journal of Graph Theory Discrete mathematics Planar graph
5	In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2004-08-04 12:47:16 Network flow Combinatorial optimization Flow network Operations research Maximum flow problem Cut FordFulkerson algorithm Minimum cut Shortest path problem Planar graph Split Topology
6	Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:44:46 NP-complete problems Chordal graph Bipartite graph Clique problem Interval graph Claw-free graph Clique Graph minor Perfect graph Split graph Independent set Graph
7	Weighted SCAN for Modeling Cooperative Group Role Dynamics Anton Chertov, Ziad Kobti, and Scott D. Goodwin world scenarios. However, SCAN in its current form targets only unweighted graphs and we identify a serious limit Add to Reading List Source URL: game.itu.dk Language: English - Date: 2010-08-10 12:41:00 Graph theory Mathematics Network theory Algebraic graph theory Edsger W. Dijkstra Cluster analysis Data mining Graph Spectral clustering Modularity Pathfinding Split
8	C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/ptolemaic-roots/ptolesplit-journal.dvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-01-29 06:00:42 Graph theory Graph operations Chordal graph Line graph Clique Split graph Ptolemaic graph Block graph Distance-hereditary graph Interval graph Pathwidth Trivially perfect graph
9	C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-02 16:29:21 Graph operations Graph coloring Chordal graph Line graph Split graph Clique Forbidden graph characterization Neighbourhood Pathwidth Strongly chordal graph
10	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-05-03 06:37:17 Graph theory NP-complete problems Clique Independent set Split graph Neighbourhood Bipartite graph Degree Vertex Graph Line graph Chordal graph