„Graph problems“

Suchergebnisse

867 Treffer

• The graphic designer and his design problems – creative problems of the graphic designer ; design and training in graphic design = Gestaltungsprobleme des Grafikers = Les problèmes d'un graphiste
  Müller-Brockmann, Josef 1983 Niggli
• Bus routing problems on acyclic networks
  Röck, Hans 1981 Techn. Univ., Fachbereich 20
• Determination of trace elements in plant materials by slurry sampling graphite furnace AAS — some analytical problems
  Dobrowolski, Ryszard ; Mierzwa, Jerzy
• Convergence analysis of M-iteration for -nonexpansive mappings with directed graphs applicable in image deblurring and signal recovering problems
  Chairatsiripong, Chonjaroen ; Yambangwai, Damrongsak ; Thianwan, Tanakit
• Das berühmte fünfte Postulat des Euklid – bewiesen durch seine eigenen Forderungen und Lehrsätze, des ersten Buches seiner "Elemente" nebst nachfolgendem verwandten Problem, vorgelegt zur Lösung allen Mathematikern der Erdrunde. Zweiter Teil, Lösung des Problems
  Kopečný, Josef 1934 C. F. Wigand Graphische Kunstanstalt A.G.
• Scheduling problems and mixed graph colorings
  Sotskov, Jurij Nazarovič ; Tanaev, Vjačeslav Sergeevič ; Werner, Frank 1998 Univ., Fak. für Mathematik
• Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
  Leedan, Yoram ; Meer, Peter
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
  Lipski, W. ; Preparata, F. P.
• Space efficient algorithms for some graph theoretical problems
  Ja'Ja', Joseph ; Simon, Janos
• Annealing Algorithms for Multisource Absolute Location Problems on Graph
  Righini, Giovanni
• Superposition of Choice Functions and Its Application to Tornado Prediction and Search Problems
  Aleskerov, Fuad T. ; Demin, Sergey ; Shvydun, Sergey
• The Graph Isomorphism Problem and the GI-Completeness of Selected Problems from Context-Free Grammars and Rewrite Systems
  Fink Amores, Michael Christian
• Biconic subdivision of surfaces of revolution and its applications in intersection problems
  Jia, Jinyuan ; Tang, Kai ; Joneja, Ajay
• Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
  Gramm, Jens ; Guo, Jiong ; Hüffner, Falk ; Niedermeier, Rolf
• Element-free Galerkin method using directed graph and its application to creep problems
  Hagihara, S. ; Tsunori, M. ; Ikeda, T. ; Miyazaki, N.
• Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
  Henzinger, M. R. ; Fredman, M. L.
• On Certificates and Lookahead in Dynamic Graph Problems
  Khanna, S. ; Motwani, R. ; Wilson, R. H.
• Refinement algorithms for time-dependent discrete optimization problems – = Verfeinerungsalgorithmen für zeitabhängige diskrete Optimierungsprobleme
  Gnegel, Fabian 2022 Brandenburgische Technische Universität Cottbus-Senftenberg, Fakultät 1, MINT - Mathematik, Informatik, Phystik, Elektro- und Informationstechnik, Institut für Mathematik
• Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs
  Pietropaoli, Ugo
• A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints
  Thunberg, Johan ; Ögren, Petter